{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T14:43:57Z","timestamp":1772030637276,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132607","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"644-652","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Truthful randomized mechanisms for combinatorial auctions"],"prefix":"10.1145","author":[{"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem, Israel"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Israel"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Archer A.","year":"2003","unstructured":"A. Archer , C. Papadimitriou , K. Talwar , and E. Tardos . An approximate truthful mechanism for combinatorial auctions with single parameter agent . In Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA) , 2003 . A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agent. In Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA), 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846250"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"key":"e_1_3_2_1_4_1","first-page":"19","article-title":"Multipart pricing of public goods","volume":"2","author":"Clarke E. H.","year":"1971","unstructured":"E. H. Clarke . Multipart pricing of public goods . Public Choice , 2 : 19 -- 33 , 1971 . E. H. Clarke. Multipart pricing of public goods. Public Choice, 2:19--33, 1971.","journal-title":"Public Choice"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033428.001.0001","volume-title":"Combinatorial Auctions","author":"Cramton P.","year":"2005","unstructured":"P. Cramton , Y. Shoham , and R. Steinberg (Editors). Combinatorial Auctions . MIT Press . Forthcoming., 2005 . http:\/\/www.cramton.umd.edu\/papers2000-2004\/cramton-shoham-steinberg-combinatorial-auctions.pdf. P. Cramton, Y. Shoham, and R. Steinberg (Editors). Combinatorial Auctions. MIT Press. Forthcoming., 2005. http:\/\/www.cramton.umd.edu\/papers2000-2004\/cramton-shoham-steinberg-combinatorial-auctions.pdf."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060681"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109675"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132523"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509921"},{"key":"e_1_3_2_1_10_1","unstructured":"Andrew Goldberg Jason Hartline Anna Karlin Mike Saks and Andrew Wright. Competitive auctions. Submitted.  Andrew Goldberg Jason Hartline Anna Karlin Mike Saks and Andrew Wright. Competitive auctions. Submitted."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0899-8256(03)00184-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_10"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946351"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501161"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_18_1","volume-title":"Microeconomic Theory","author":"Mas-Collel A.","year":"1995","unstructured":"A. Mas-Collel , W. Whinston , and J. Green . Microeconomic Theory . Oxford university press , 1995 . A. Mas-Collel, W. Whinston, and J. Green. Microeconomic Theory. Oxford university press, 1995."},{"key":"e_1_3_2_1_19_1","volume-title":"AAAI-02","author":"Mua'lem Ahuva","year":"2002","unstructured":"Ahuva Mua'lem and Noam Nisam . Truthful approximation mechanisms for restricted combinatorial auctions . In AAAI-02 , 2002 . Ahuva Mua'lem and Noam Nisam. Truthful approximation mechanisms for restricted combinatorial auctions. In AAAI-02, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352898"},{"key":"e_1_3_2_1_22_1","unstructured":"Noam Nisan and Ilya Segal. The communication requirements of efficient allocations and supporting prices. To appear in Journal of Economic Theory.  Noam Nisan and Ilya Segal. The communication requirements of efficient allocations and supporting prices. To appear in Journal of Economic Theory."},{"key":"e_1_3_2_1_23_1","volume-title":"A Course in Game Theory","author":"Osborne M. J.","year":"1994","unstructured":"M. J. Osborne and A. Rubistein . A Course in Game Theory . MIT press , 1994 . M. J. Osborne and A. Rubistein. A Course in Game Theory. MIT press, 1994."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":25,"alternative-id":["10.1145\/1132516.1132607","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132607","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}