{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T12:20:31Z","timestamp":1709382031813},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4008,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0004-3702(02)00229-1","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T20:43:49Z","timestamp":1031604229000},"page":"231-243","source":"Crossref","is-referenced-by-count":24,"title":["Tractable combinatorial auctions and b-matching"],"prefix":"10.1016","volume":"140","author":[{"given":"Moshe","family":"Tennenholtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00229-1_BIB001","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","article-title":"A polynomial algorithm for b-matchings: An alternative approach","volume":"24","author":"Anstee","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(02)00229-1_BIB002","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB003","unstructured":"S. de Vries, R. Vohra, Combinatorial auctions: A brief survey, Unpublished manuscript, 2000"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB004","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"858","article-title":"What your computer really needs to know, you learned in kindergarten","author":"Durfee","year":"1992"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB005","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"548","article-title":"Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches","author":"Fujishima","year":"1999"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB006","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0004-3702(97)00025-8","article-title":"Negotiation and cooperation in multi-agent environments","volume":"94","author":"Kraus","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB007","series-title":"Proc. ACM Conference on Electronic Commerce","first-page":"96","article-title":"Truth revelation in rapid, approximately efficient combinatorial auctions","author":"Lehmann","year":"1999"},{"issue":"1","key":"10.1016\/S0004-3702(02)00229-1_BIB008","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(00)00024-2","article-title":"Optimal auctions revisited","volume":"120","author":"Monderer","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB009","series-title":"Proc. ACM Conference on Electronic Commerce","first-page":"1","article-title":"Bidding and allocation in combinatorial auctions","author":"Nisan","year":"2000"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB010","series-title":"Proc. ACM Conference on Electronic Commerce","first-page":"148","article-title":"Ibundle: An efficient ascending price bundle auction","author":"Parkes","year":"1999"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB011","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0190(00)00073-9","article-title":"Constrained multi-object auctions and b-matching","volume":"75","author":"Penn","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(02)00229-1_BIB012","series-title":"Rules of Encounter","author":"Rosenschein","year":"1994"},{"issue":"8","key":"10.1016\/S0004-3702(02)00229-1_BIB013","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinatorial auctions","volume":"44","author":"Rothkopf","year":"1998","journal-title":"Management Sci."},{"key":"10.1016\/S0004-3702(02)00229-1_BIB014","series-title":"Proc. 2nd International Conference on Multi-Agent Systems","first-page":"299","article-title":"Limitations of the vickrey auction in computational multiagent systems","author":"Sandholm","year":"1996"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB015","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"542","article-title":"An algorithm for optimal winner determination in combinatorial auctions","author":"Sandholm","year":"1999"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB016","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Electronic commerce: From game-theoretic and economic models to working protocols","author":"Tennenholtz","year":"1999"},{"key":"10.1016\/S0004-3702(02)00229-1_BIB017","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1006\/game.2000.0822","article-title":"Auction protocols for decentralized scheduling","volume":"35","author":"Wellman","year":"2001","journal-title":"Games and Economic Behavior"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002291?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002291?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T11:54:40Z","timestamp":1555070080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0004370202002291"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00229-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}