{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:10:02Z","timestamp":1742397002105},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003274"},{"type":"electronic","value":"9783540363781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36378-5_5","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:17:04Z","timestamp":1187248624000},"page":"69-86","source":"Crossref","is-referenced-by-count":19,"title":["Effectiveness of Preference Elicitation in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Hudson","sequence":"first","affiliation":[]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. ICMAS, 2000.","DOI":"10.1109\/ICMAS.2000.858429"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"S. Bikhchandani, S. de Vries, J. Schummer, and R.V. Vohra. Linear programming and Vickrey auctions, 2001.","DOI":"10.1007\/978-1-4684-9277-4_6"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E. H. Clarke","year":"1971","unstructured":"E. H. Clarke. Multipart pricing of public goods. Public Choice, 11:17\u201333, 1971.","journal-title":"Public Choice"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"W. Conen and T. Sandholm. Preference elicitation in combinatorial auctions: Extended abstract. ACM-EC, 2001. A more detailed description of the algorithmic aspects appeared in the IJCAI-2001Workshop on Economic Agents, Models, and Mechanisms.","DOI":"10.1145\/501158.501191"},{"key":"5_CR5","unstructured":"W. Conen and T. Sandholm. Coherent pricing of efficient allocations in combinatorial economies. AAAI-02 workshop on Game-Theoretic and Decision-Theoretic Agents, 2002."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"W. Conen and T. Sandholm. Partial-revelation VCG mechanism for combinatorial auctions. AAAI, 2002.","DOI":"10.1007\/3-540-36378-5_3"},{"key":"5_CR7","unstructured":"Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. IJCAI, 1999."},{"key":"5_CR8","unstructured":"H. Hoos and C. Boutilier. Bidding languages for combinatorial auctions. IJCAI, 2001."},{"key":"5_CR9","unstructured":"K. Larson and T. Sandholm. Deliberation in equilibrium: Bargaining in computationally complex problems. AAAI, 2000."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"K. Leyton-Brown, M. Pearson, and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. ACM-EC, 2000.","DOI":"10.1145\/352871.352879"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"N. Nisan. Bidding and allocation in combinatorial auctions. ACM-EC, 2000.","DOI":"10.1145\/352871.352872"},{"key":"5_CR12","unstructured":"N. Nisan and I. Segal. The communication complexity of efficient allocation problems, 2002. Draft. Second version March 5th."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"D. C. Parkes. Optimal auction design for agents with hard valuation problems. Agent-Mediated Electronic Commerce Workshop at IJCAI, 1999.","DOI":"10.1007\/10720026_11"},{"key":"5_CR14","unstructured":"D. C. Parkes and L. Ungar. Iterative combinatorial auctions: Theory and practice. AAAI, 2000."},{"issue":"8","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. H. Rothkopf","year":"1998","unstructured":"M. H. Rothkopf, A. Peke\u010d, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131\u20131147, 1998.","journal-title":"Management Science"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1086\/261670","volume":"98","author":"M. H. Rothkopf","year":"1990","unstructured":"M. H. Rothkopf, T. J. Teisberg, and E. P. Kahn. Why are Vickrey auctions rare? Journal of Political Economy, 98(1):94\u2013109, 1990.","journal-title":"Journal of Political Economy"},{"key":"5_CR17","unstructured":"T. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. AAAI, 1993."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"T. Sandholm. eMediator: A next generation electronic commerce server. AGENTS, 2000.","DOI":"10.1145\/336595.337522"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1\u201354, Jan. 2002.","journal-title":"Artificial Intelligence"},{"key":"5_CR20","unstructured":"T. Sandholm, S. Suri, A. Gilpin, and D. Levine. CABOB: A fast optimal algorithm for combinatorial auctions. IJCAI, 2001."},{"key":"5_CR21","unstructured":"T. Smith, T. Sandholm, and R. Simmons. Constructing and clearing combinatorial exchanges using preference elicitation. AAAI workshop on Preferences in AI and CP: Symbolic Approaches, 2002."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"P. R. Wurman and M. P. Wellman. AkBA: A progressive, anonymous-price combinatorial auction. ACM-EC, 2000.","DOI":"10.1145\/352871.352874"}],"container-title":["Lecture Notes in Computer Science","Agent-Mediated Electronic Commerce IV. Designing Mechanisms and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36378-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:06:58Z","timestamp":1556770018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36378-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003274","9783540363781"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36378-5_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}