{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:38:36Z","timestamp":1743064716388,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259197"},{"type":"electronic","value":"9783642259203"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25920-3_22","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T20:12:11Z","timestamp":1323979931000},"page":"320-335","source":"Crossref","is-referenced-by-count":0,"title":["A Robust Multi-unit Ascending-Price Auction with Complementarities against Strategic Manipulation"],"prefix":"10.1007","author":[{"given":"Masabumi","family":"Furuhata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"22_CR1","first-page":"1452","volume":"94","author":"L.M. Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. The RAND Journal of Economics\u00a094(5), 1452\u20131475 (2004)","journal-title":"The RAND Journal of Economics"},{"key":"22_CR2","unstructured":"Ausubel, L.M., Cramton, P.: Demand reduction and inefficiency in multi-unit auction. Working paper no. 96-07, Department of Economics, University of Maryland (1996)"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1111\/j.1468-0262.2006.00694.x","volume":"74","author":"Y.K. Che","year":"2006","unstructured":"Che, Y.K., Kim, J.: Robustly collusion-proof implementation. Econometrica\u00a074(4), 1063\u20131107 (2006)","journal-title":"Econometrica"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.1040.0332","volume":"51","author":"O. G\u00fcnl\u00fc","year":"2005","unstructured":"G\u00fcnl\u00fc, O., Lad\u00e1nyi, L., de Vries, S.: A branch-and-price algorithm and new test problems for spectrum auctions. Management Science\u00a051(3), 391\u2013406 (2005)","journal-title":"Management Science"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dss.2004.08.005","volume":"39","author":"A. Iwasaki","year":"2005","unstructured":"Iwasaki, A., Yokoo, M., Terada, K.: A robust open scending-price multi-unit auction protocol against false-name bids. Decision Support Systems\u00a039, 23\u201339 (2005)","journal-title":"Decision Support Systems"},{"issue":"7-8","key":"22_CR6","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.artint.2009.01.002","volume":"173","author":"A.I. Juda","year":"2009","unstructured":"Juda, A.I., Parkes, D.C.: An options-based solution to the sequential auction problem. Artificial Intelligence\u00a0173(7-8), 876\u2013899 (2009)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1257\/0895330027166","volume":"16","author":"P. Klemperer","year":"2002","unstructured":"Klemperer, P.: What really matters in auction design. Journal of Economic Perspectives\u00a016(1), 169\u2013189 (2002)","journal-title":"Journal of Economic Perspectives"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1086\/262118","volume":"108","author":"P. Milgrom","year":"2000","unstructured":"Milgrom, P.: Putting auction theory to work: The simultaneous ascending auction. Journal of Political Economy\u00a0108(2), 245\u2013272 (2000)","journal-title":"Journal of Political Economy"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of EC-2000, pp. 1\u201312 (2000)","DOI":"10.1145\/352871.352872"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Parkes, D.C.: Iterative combinatorial auctions. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, ch. 2. MIT Press (2006)","DOI":"10.7551\/mitpress\/9780262033428.003.0003"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"1","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)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0004-3702(01)00077-7","volume":"130","author":"M. Yokoo","year":"2001","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: Robust combinatorial auction protocol against false-name bids. Artificial Intelligence\u00a0130(2), 167\u2013181 (2001)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25920-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:29:46Z","timestamp":1558297786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25920-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259197","9783642259203"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25920-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}