{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:53:01Z","timestamp":1771699981120,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441205","type":"print"},{"value":"9783540461357","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_37","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"556-572","source":"Crossref","is-referenced-by-count":55,"title":["Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Leyton-Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Nudelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Shoham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"37_CR1","unstructured":"D. Achlioptas, C. Gomes, H. Kautz, and B. Selman. Generating satisfiable instances. In AAAI-00, 2000."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"A. Anderson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. In ICMAS, 2000.","DOI":"10.1109\/ICMAS.2000.858429"},{"key":"37_CR3","unstructured":"P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the Really Hard Problems Are. In IJCAI-91, 1991."},{"key":"37_CR4","unstructured":"S. de Vries and R. Vohra. Combinatorial auctions: A brief survey. Unpublished, 2000."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"J. Friedman. Multivariate adaptive regression splines. Annals of Statistics, 19, 1991.","DOI":"10.1214\/aos\/1176347963"},{"key":"37_CR6","unstructured":"Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI-99, 1999."},{"key":"37_CR7","unstructured":"Carla P. Gomes and Bart Selman. Problem structure in the presence of perturbations. In AAAI\/IAAI, 1997."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"R. Gonen and D. Lehmann. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. In ACM Conference on Electronic Commerce, 2000.","DOI":"10.1145\/352871.352873"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"T. Hastie, R. Tibshirani, and J. Friedman. Elements of Statistical Learning. Springer, 2001.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"R. C. Holte. Combinatorial auctions, knapsack problems, and hill-climbing search. In Canadian Conference on AI, 2001.","DOI":"10.1007\/3-540-45153-6_6"},{"key":"37_CR11","unstructured":"H. H. Hoos and C. Boutilier. Solving combinatorial auctions using stochastic local search. In AAAI-00, 2000."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, and M. Chickering. A bayesian approach to tackling hard computational problems, 2001.","DOI":"10.1016\/S1571-0653(04)00335-X"},{"key":"37_CR13","unstructured":"R. Kastner, C. Hsieh, M. Potkonjak, and M. Sarrafzadeh. On the sensitivity of incremental algorithms for combinatorial auctions, 2002. UCLA CS Tech. Report 020000."},{"key":"37_CR14","unstructured":"R. Korf and M. Reid. Complexity analysis of admissible heuristic search. AAAI-98, 1998."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"K. Leyton-Brown, M. Pearson, and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM Conference on Electronic Commerce, 2000.","DOI":"10.1145\/352871.352879"},{"key":"37_CR16","unstructured":"K. Leyton-Brown, Yoav Shoham, and Moshe Tennenholtz. An algorithm for multi-unit combinatorial auctions. In Proceedings of AAAI-00, 2000."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity for characteristic \u2018phase transitions\u2018. Nature, 400, 1998.","DOI":"10.1038\/22055"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"N. Nisan. Bidding and allocation in combinatorial auctions. In ACM Conference on Electronic Commerce, 2000.","DOI":"10.1145\/352871.352872"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"D. C. Parkes. iBundle: An efficient ascending price bundle auction. In ACM Conference on Electronic Commerce, 1999.","DOI":"10.1145\/336992.337032"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"M. H. Rothkopf, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8), 1998.","DOI":"10.1287\/mnsc.44.8.1131"},{"key":"37_CR21","unstructured":"T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In IJCAI-99, 1999."},{"key":"37_CR22","unstructured":"T. Sandholm, S. Suri, A. Gilpin, and D. Levine. Cabob: A fast optimal algorithm for combinatorial auctions. In IJCAI-01, 2001."},{"key":"37_CR23","unstructured":"Dale Schuurmans, Finnegan Southey, and Robert C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In IJCAI-01, 2001."},{"key":"37_CR24","unstructured":"J. Slaney and T. Walsh. Backbones in optimization and approximation. In IJCAI-01, 2001."},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"W. Zhang. State-Space Search: Algorithms, Complexity, Extensions, and Applications. Springer, 1999.","DOI":"10.1007\/978-1-4612-1538-7"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:30Z","timestamp":1556411130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}