{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:17Z","timestamp":1794357197969,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_454","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:37:34Z","timestamp":1214491054000},"page":"997-1001","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","reference":[{"key":"454_CR1_454","doi-asserted-by":"crossref","unstructured":"Andelman, N., Mansour, Y.: A\u00a0sufficient condition for truthfulness with single parameter agents. In: Proc. 8th ACM Conference on Electronic Commerce (EC),Ann, Arbor, Michigan, June (2006)","DOI":"10.1145\/1134707.1134709"},{"key":"454_CR2_454","first-page":"205","volume-title":"Proc. 14th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA)","author":"A. Archer","year":"2003","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, E.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proc. 14th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA), pp. 205\u2013214. Baltimore, Maryland (2003)"},{"key":"454_CR3_454","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Meyerson, A.: Reducing truth-telling online mechanisms to online optimization. In: Proc. 35th Ann. ACM. Symp. on Theory of Comput. (STOC), San Diego, California (2003)","DOI":"10.1145\/780542.780616"},{"key":"454_CR4_454","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I., Gutner, S.: Truthful unsplittable flow for large capacity networks. In: Proc. 19th Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 320\u2013329 (2007)","DOI":"10.1145\/1248377.1248432"},{"key":"454_CR5_454","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge (TARK), pp. 72\u201387. ACM Press (2003). http:\/\/doi.acm.org\/10.1145\/846241.846250","DOI":"10.1145\/846241.846250"},{"key":"454_CR6_454","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. 37th Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"454_CR7_454","first-page":"72","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02), New York, 19\u201321 May 2002","author":"A. Fiat","year":"2002","unstructured":"Fiat, A., Goldberg, A.V., Hartline, J.D., Karlin, A.R.: Competitive generalized auctions. In: Proc. 34th Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 72\u201381 (2002)"},{"key":"454_CR8_454","first-page":"735","volume-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), New York, 7\u20139 January 2001","author":"A.V. Goldberg","year":"2001","unstructured":"Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Proc. 12th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA), pp. 735\u2013744 (2001)"},{"key":"454_CR9_454","doi-asserted-by":"crossref","unstructured":"Krysta, P.: Greedy approximation via duality for packing, combinatorial auctions and routing. In: Proc. 30th Int. Conference on Mathematical Foundations of Comput. Sci. (MFCS). Lecture Notes in Computer Science, vol.\u00a03618, pp. 615\u2013627 (2005)","DOI":"10.1007\/11549345_53"},{"key":"454_CR10_454","doi-asserted-by":"crossref","unstructured":"Lehmann, D.J., O'Callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: Proc. 1st ACM Conference on Electronic Commerce (EC), pp. 96\u2013102 (1999)","DOI":"10.1145\/336992.337016"},{"key":"454_CR11_454","unstructured":"Mu'alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: Proc. 18th Nat. Conf. Artificial Intelligence, pp. 379\u2013384. AAAI (2002)"},{"key":"454_CR12_454","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6, 58\u201373 (1981)","journal-title":"Math. Oper.Res."},{"key":"454_CR13_454","doi-asserted-by":"crossref","unstructured":"Ronen, A.: On approximating optimal auctions (extended abstract). In: Proc. 3rd ACM Conference on Electronic Commerce (EC), pp. 11\u201317 (2001)","DOI":"10.1145\/501158.501160"},{"key":"454_CR14_454","doi-asserted-by":"crossref","unstructured":"Ronen, A., Saberi, A.: On the hardness of optimal auctions. In: Proc. 43rd Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pp. 396\u2013405 (2002)","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-0-387-30162-4_454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:46Z","timestamp":1738254766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_454"}},"subtitle":["2005; Briest, Krysta, V\u00f6cking"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_454","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}