{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:22Z","timestamp":1725558922159},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142635"},{"type":"electronic","value":"9783642142642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14264-2_17","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T01:34:28Z","timestamp":1278293668000},"page":"161-170","source":"Crossref","is-referenced-by-count":1,"title":["Empirical Hardness for Mixed Auctions"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Almajano","sequence":"first","affiliation":[]},{"given":"Jes\u00fas","family":"Cerquides","sequence":"additional","affiliation":[]},{"given":"Juan A.","family":"Rodriguez-Aguilar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Cerquides, J., Endriss, U., Giovannucci, A., Rodr\u00edguez-Aguilar, J.A.: Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In: IJCAI, pp. 1221\u20131226 (2007)"},{"volume-title":"Combinatorial Auctions","year":"2006","key":"17_CR2","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"key":"17_CR3","unstructured":"Valeria Fionda, G.G.: Charting the tractability frontier of mixed multi-unit combinatorial auctions. In: Proceedings of IJCAI 2009, pp. 134\u2013139 (2009)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Empirical hardness models for combinatorial auctions. In: Cramton, et al. (eds.) [2], ch.\u00a019, pp. 479\u2013504","DOI":"10.7551\/mitpress\/9780262033428.003.0020"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Giovannucci, A., Vinyals, M., Rodr\u00edguez-Aguilar, J.A., Cerquides, J.: Computationally-efficient winner determination for mixed multi-unit combinatorial auctions. In: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-agent Systems, pp. 1071\u20131078 (2008)","DOI":"10.1145\/1329125.1329253"},{"key":"17_CR6","unstructured":"Giovannucci, A., Cerquides, J., Rodriguez-Aguilar, J.A.: Proving the correctness of the CCIP solver for MMUCA, Tech. rep., IIIA-CSIC (2007)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jalgor.2008.02.008","volume":"63","author":"M. Vinyals","year":"2008","unstructured":"Vinyals, M., Giovannucci, A., Cerquides, J., Meseguer, P., Rodriguez-Aguilar, J.A.: A test suite for the evaluation of mixed multi-unit combinatorial auctions. Journal of Algorithms\u00a063, 130\u2013150 (2008)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14264-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:48:18Z","timestamp":1559227698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14264-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142635","9783642142642"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14264-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}