{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:59:02Z","timestamp":1794592742089,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_454","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T14:28:46Z","timestamp":1553092126000},"page":"2312-2318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Utilitarian Mechanism Design for Single-Minded Agents"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"454_CR2183","doi-asserted-by":"crossref","unstructured":"Andelman N, Mansour Y (2006) A sufficient condition for truthfulness with single parameter agents. In: Proceedings of the 8th ACM conference on electronic commerce (EC), Ann Arbor, June 2006","DOI":"10.1145\/1134707.1134709"},{"key":"454_CR2184","unstructured":"Archer A, Papadimitriou CH, Talwar K, Tardos E (2003) An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proceedings of the 14th annual ACM\u2013SIAM symposium on discrete algorithms (SODA), Baltimore, pp 205\u2013214"},{"key":"454_CR2185","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Meyerson A (2003) Reducing truth-telling online mechanisms to online optimization. In: Proceedings of the 35th annual ACM symposium on theory of computing (STOC), San Diego","DOI":"10.1145\/780615.780616"},{"key":"454_CR2186","doi-asserted-by":"crossref","unstructured":"Azar Y, Gamzu I, Gutner S (2007) Truthful unsplittable flow for large capacity networks. In: Proceedings of the 19th annual ACM symposium on parallelism in algorithms and architectures (SPAA), pp 320\u2013329","DOI":"10.1145\/1248377.1248432"},{"key":"454_CR2187","doi-asserted-by":"crossref","unstructured":"Bartal Y, Gonen R, Nisan N (2003) Incentive compatible multi unit combinatorial auctions. In: Proceedings of the 9th conference on theoretical aspects of rationality and knowledge (TARK), ACM Press, pp 72\u201387. http:\/\/doi.acm.org\/10.1145\/846241.846250","DOI":"10.1145\/846241.846250"},{"key":"454_CR2188","doi-asserted-by":"crossref","unstructured":"Briest P, Krysta P, V\u00f6cking B (2005) Approximation techniques for utilitarian mechanism design. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC), pp 39\u201348","DOI":"10.1145\/1060590.1060597"},{"key":"454_CR2189","doi-asserted-by":"crossref","unstructured":"Fiat A, Goldberg AV, Hartline JD, Karlin AR (2002) Competitive generalized auctions. In: Proceedings of the 34th annual ACM symposium on theory of computing (STOC), pp 72\u201381","DOI":"10.1145\/509907.509921"},{"key":"454_CR2190","unstructured":"Goldberg AV, Hartline JD, Wright A (2001) Competitive auctions and digital goods. In: Proceedings of the 12th annual ACM\u2013SIAM symposium on discrete algorithms (SODA), pp 735\u2013744"},{"key":"454_CR2191","doi-asserted-by":"crossref","unstructured":"Krysta P (2005) Greedy approximation via duality for packing, combinatorial auctions and routing. In: Proceedings of the 30th international conference on mathematical foundations of computer science (MFCS). Lecture notes in computer science, vol 3618, pp 615\u2013627","DOI":"10.1007\/11549345_53"},{"key":"454_CR2192","doi-asserted-by":"crossref","unstructured":"Lehmann DJ, O'Callaghan LI, Shoham Y (1999) Truth revelation in approximately efficient combinatorial auctions. In: Proceedings of the 1st ACM conference on electronic commerce (EC), pp 96\u2013102","DOI":"10.1145\/336992.337016"},{"key":"454_CR2193","unstructured":"Mu'alem A, Nisan N (2002) Truthful approximation mechanisms for restricted combinatorial auctions. In: Proceedings of the 18th national conference on artificial intelligence. AAAI, pp 379\u2013384"},{"key":"454_CR2194","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson RB (1981) Optimal auction design. Math Oper Res 6:58\u201373","journal-title":"Math Oper Res"},{"key":"454_CR2195","doi-asserted-by":"crossref","unstructured":"Ronen A (2001) On approximating optimal auctions (extended abstract). In: Proceedings of the 3rd ACM conference on electronic commerce (EC), pp 11\u201317","DOI":"10.1145\/501158.501160"},{"key":"454_CR2196","doi-asserted-by":"crossref","unstructured":"Ronen A, Saberi A (2002) On the hardness of optimal auctions. In: Proceedings of the 43rd annual IEEE symposium on foundations of computer science (FOCS), pp 396\u2013405","DOI":"10.1109\/SFCS.2002.1181964"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:50:09Z","timestamp":1792108209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_454","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}