{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T21:03:17Z","timestamp":1747170197448},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_3","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"13-25","source":"Crossref","is-referenced-by-count":8,"title":["Preference Elicitation and Query Learning"],"prefix":"10.1007","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[]},{"given":"Jeffrey C.","family":"Jackson","sequence":"additional","affiliation":[]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Zinkevich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-3_CR1.1","doi-asserted-by":"crossref","unstructured":"Sandholm, T.: eMediator: A next generation electronic commerce server. Computational Intelligence??18, 656???676 (2002);","DOI":"10.1111\/1467-8640.t01-1-00209"},{"key":"#cr-split#-3_CR1.2","unstructured":"Special issue on Agent Technology for Electronic Commerce, Early versions appeared in the Conference on Autonomous Agents (AGENTS 2000), pp. 73???96 (2000);"},{"key":"#cr-split#-3_CR1.3","unstructured":"AAAI 1999 Workshop on AI in Electronic Commerce, Orlando, FL, pp. 46???55 (July 1999) and as a Washington University, St. Louis, Dept. of Computer Science technical report WU-CS-99-02 (January 1999)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), Minneapolis, MN, pp. 1\u201312 (2000)","DOI":"10.1145\/352871.352872"},{"key":"#cr-split#-3_CR3.1","doi-asserted-by":"crossref","unstructured":"Lehmann, D., O???Callaghan, L.I., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM (2003) (to appear);","DOI":"10.1145\/585265.585266"},{"key":"#cr-split#-3_CR3.2","unstructured":"Early version appeared in ACMEC 1999 (1999)"},{"key":"#cr-split#-3_CR4.1","doi-asserted-by":"crossref","unstructured":"Conen, W., Sandholm, T.: Preference elicitation in combinatorial auctions: Extended abstract. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), Tampa, FL, pp. 256???259 (2001);","DOI":"10.1145\/501158.501191"},{"key":"#cr-split#-3_CR4.2","unstructured":"A more detailed description of the algorithmic aspects appeared in the IJCAI-2001 Workshop on Economic Agents, Models, and Mechanisms, pp. 71???80 (2001)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Zinkevich, M., Blum, A., Sandholm, T.: On polynomial-time preference elicitation with value queries. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), San Diego, CA (2003)","DOI":"10.1145\/779928.779949"},{"key":"3_CR6","unstructured":"Nisan, N., Segal, I.: The communication complexity of efficient allocation problems (2002) ( Draft. Second version March 5, 2002)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science\u00a044, 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence\u00a0135, 1\u201354 (2002); First appeared as an invited talk at the First International Conference on Information and Computation Economies, Charleston, SC, October 25\u201328 (1998), Extended version appeared asWashington Univ., Dept. of Computer Science, tech report WUCS-99-01, January 28 (1999), Conference version appeared at the International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden. pp. 542\u2013547 (1999)","journal-title":"Artificial Intelligence"},{"key":"3_CR9","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proceedings of the 16 th International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, pp. 548\u2013553 (1999)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the 4 th International Conference on Multi-Agent Systems (ICMAS), Boston, MA, pp. 39\u201346 (2000)","DOI":"10.1109\/ICMAS.2000.858429"},{"key":"3_CR11","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A fast optimal algorithm for combinatorial auctions. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), Seattle, WA, pp. 1102\u20131108 (2001)"},{"key":"#cr-split#-3_CR12.1","doi-asserted-by":"crossref","unstructured":"Sandholm, T.: eMediator: A next generation electronic commerce server. In: Proceedings of the 4 th International Conference on Autonomous Agents (AGENTS), Barcelona, Spain, pp. 73???96 (2000);","DOI":"10.1145\/336595.337522"},{"key":"#cr-split#-3_CR12.2","unstructured":"Early version appeared in the AAAI 1999 Workshop on AI in Electronic Commerce, Orlando, FL, pp. 46???55 (July 1999) and as a Washington University, St. Louis, Dept. of Computer Science technical report WU-CS-99-02 (January 1999)"},{"key":"3_CR13","unstructured":"Hoos, H., Boutilier, C.: Bidding languages for combinatorial auctions. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), Seattle, WA, pp. 1211\u20131217 (2001)"},{"key":"3_CR14","unstructured":"Sandholm, T., Suri, S.: Side constraints and non-price attributes in markets. In: IJCAI 2001 Workshop on Distributed Constraint Reasoning, Seattle, WA, pp. 55\u201361 (2001)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Conen, W., Sandholm, T.: Differential-revelation VCG mechanisms for combinatorial auctions. In: AAMAS 2002 workshop on Agent-Mediated Electronic Commerce (AMEC), Bologna, Italy (2002)","DOI":"10.1007\/3-540-36378-5_3"},{"key":"#cr-split#-3_CR16.1","doi-asserted-by":"crossref","unstructured":"Hudson, B., Sandholm, T.: Effectiveness of preference elicitation in combinatorial auctions. In: AAMAS 2002 workshop on Agent-Mediated Electronic Commerce (AMEC), Bologna, Italy (2002);","DOI":"10.1007\/3-540-36378-5_5"},{"key":"#cr-split#-3_CR16.2","unstructured":"Extended version: Carnegie Mellon University, Computer Science Department, CMU-CS-02-124, March. Also: Stanford Institute for Theoretical Economics workshop (SITE 2002) (2002)"},{"key":"3_CR17","unstructured":"Smith, T., Sandholm, T., Simmons, R.: Constructing and clearing combinatorial exchanges using preference elicitation. In: AAAI 2002 workshop on Preferences in AI and CP: Symbolic Approaches, pp. 87\u201393 (2002)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Parkes, D.C.: Optimal auction design for agents with hard valuation problems. In: Agent-Mediated Electronic Commerce Workshop at the International Joint Conference on Artificial Intelligence, Stockholm, Sweden (1999)","DOI":"10.1007\/10720026_11"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Parkes, D.C.: iBundle: An efficient ascending price bundle auction. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), Denver, CO, pp. 148\u2013157 (1999)","DOI":"10.1145\/336992.337032"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Milgrom, P.: Ascending auctions with package bidding. Technical report (2001) (Draft June 7, 2001)","DOI":"10.2202\/1534-5963.1019"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Wurman, P.R., Wellman, M.P.: AkBA: A progressive, anonymous-price combinatorial auction. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), Minneapolis, MN, pp. 21\u201329 (2000)","DOI":"10.1145\/352871.352874"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Bikhchandani, S., de Vries, S., Schummer, J., Vohra, R.V.: Linear programming and Vickrey auctions (2001) (Draft )","DOI":"10.1007\/978-1-4684-9277-4_6"},{"key":"3_CR26","unstructured":"Bikhchandani, S., Ostroy, J.: The package assignment model. UCLA Working Paper Series, mimeo (2001)"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., Karpinski, M.: Learning read-once formulas with queries. Journal of the ACM\u00a040, 185\u2013210 (1993)","journal-title":"Journal of the ACM"},{"key":"3_CR28","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. In: Proc. 22nd Annual ACM Symposium on Theory of Computing, Baltimore, pp. 213\u2013223 (1990)","DOI":"10.1145\/100216.100244"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T04:56:59Z","timestamp":1635742619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}