{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:02Z","timestamp":1750307822785,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,8]],"date-time":"2008-07-08T00:00:00Z","timestamp":1215475200000},"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":[[2008,7,8]]},"DOI":"10.1145\/1386790.1386807","type":"proceedings-article","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T14:47:02Z","timestamp":1229525222000},"page":"88-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Informational overhead of incentive compatibility"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liad","family":"Blumrosen","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2202\/1534-5955.1019"},{"key":"e_1_3_2_1_2_1","volume-title":"Combinatorial Auctions","author":"Lawrence","year":"2006","unstructured":"Lawrence M. Ausubel and Paul Milgrom . In P. Cramton and Y. Shoham and R. Steinberg (Editors), Combinatorial Auctions . Chapter 1. The Lovely but Lonely Vickrey Auction. MIT Press ., 2006 . Lawrence M. Ausubel and Paul Milgrom. In P. Cramton and Y. Shoham and R. Steinberg (Editors), Combinatorial Auctions. Chapter 1. The Lovely but Lonely Vickrey Auction. MIT Press., 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9277-4_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134715"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"key":"e_1_3_2_1_7_1","volume-title":"SODA'08","author":"Emek Yuval","year":"2008","unstructured":"Yuval Emek , David Peleg , and Liam Roditty . A near-linear time algorithm for computing replacement paths in planar directed graph . In SODA'08 , 2008 . Yuval Emek, David Peleg, and Liam Roditty. A near-linear time algorithm for computing replacement paths in planar directed graph. In SODA'08, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875576"},{"key":"e_1_3_2_1_9_1","volume-title":"Communication Complexity","author":"Kushilevitz Eyal","year":"1997","unstructured":"Eyal Kushilevitz and Noam Nisan . Communication Complexity . Cambridge University Press , 1997 . Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1997."},{"volume-title":"Tim Roughgarden","author":"Nisan Noam","key":"e_1_3_2_1_10_1","unstructured":"Noam Nisan . Introduction to Mechanism Design (for Computer Scientists) In Noam Nisan , Tim Roughgarden , Eva Tardos and Vijay Vazirani (Editors), Algorithmic Game Theory. Chapter 9. Noam Nisan. Introduction to Mechanism Design (for Computer Scientists) In Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (Editors), Algorithmic Game Theory. Chapter 9."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_13_1","volume-title":"Combinatorial Auctions","author":"Segal Ilya","year":"2006","unstructured":"Ilya Segal . In P. Cramton and Y. Shoham and R. Steinberg (Editors), Combinatorial Auctions . Chapter 11. The Communication Requirements of Combinatorial Allocation Problems. MIT Press ., 2006 . Ilya Segal. In P. Cramton and Y. Shoham and R. Steinberg (Editors), Combinatorial Auctions. Chapter 11. The Communication Requirements of Combinatorial Allocation Problems. MIT Press., 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.09.011"},{"key":"e_1_3_2_1_15_1","volume-title":"The communication cost of selfishness","author":"Segal Ilya","year":"2006","unstructured":"Ilya Segal and Ronald Fadel . The communication cost of selfishness , 2006 . Journal of Ecnomic Theory , to appear. Ilya Segal and Ronald Fadel. The communication cost of selfishness, 2006. Journal of Ecnomic Theory, to appear."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"}],"event":{"name":"EC '08: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Chicago Il USA","acronym":"EC '08"},"container-title":["Proceedings of the 9th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386790.1386807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1386790.1386807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:48Z","timestamp":1750255068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386790.1386807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,8]]},"references-count":16,"alternative-id":["10.1145\/1386790.1386807","10.1145\/1386790"],"URL":"https:\/\/doi.org\/10.1145\/1386790.1386807","relation":{},"subject":[],"published":{"date-parts":[[2008,7,8]]},"assertion":[{"value":"2008-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}