{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:11Z","timestamp":1750307531101,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T00:00:00Z","timestamp":1246838400000},"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":[[2009,7,6]]},"DOI":"10.1145\/1566374.1566396","type":"proceedings-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:31Z","timestamp":1247665891000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal collusion-resistant mechanisms with verification"],"prefix":"10.1145","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[{"name":"Universita' di Salerno, Salerno, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186813"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.10.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_52"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684260"},{"key":"e_1_3_2_1_7_1","first-page":"1163","volume-title":"Proc. of Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Christodoulou G.","year":"2007","unstructured":"G. Christodoulou , E. Koutsoupias , and A. Vidali . A lower bound for scheduling mechanisms . In Proc. of Annual ACM Symposium on Discrete Algorithms (SODA) , pages 1163 -- 1170 , 2007 . G. Christodoulou, E. Koutsoupias, and A. Vidali. A lower bound for scheduling mechanisms. In Proc. of Annual ACM Symposium on Discrete Algorithms (SODA), pages 1163--1170, 2007."},{"key":"e_1_3_2_1_8_1","first-page":"17","volume-title":"Public Choice","author":"Clarke E.H.","year":"1971","unstructured":"E.H. Clarke . Multipart Pricing of Public Goods . Public Choice , pages 17 -- 33 , 1971 . E.H. Clarke. Multipart Pricing of Public Goods. Public Choice, pages 17--33, 1971."},{"key":"e_1_3_2_1_9_1","first-page":"701","volume-title":"Proc. of the 15th ACM-SIAM symposium on Discrete algorithms Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Elkind E.","year":"2004","unstructured":"E. Elkind , A. Sahai , and K. Steiglitz . Frugality in path auctions . In Proc. of the 15th ACM-SIAM symposium on Discrete algorithms Annual ACM Symposium on Discrete Algorithms (SODA) , pages 701 -- 709 , 2004 . E. Elkind, A. Sahai, and K. Steiglitz. Frugality in path auctions. In Proc. of the 15th ACM-SIAM symposium on Discrete algorithms Annual ACM Symposium on Discrete Algorithms (SODA), pages 701--709, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0122-y"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","first-page":"15","volume-title":"Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA)","author":"Gamzu I.","year":"2007","unstructured":"I. Gamzu . Improved lower bounds for non-utilitarian truthfulness . In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA) , Lecture Notes in Computer Science , pages 15 -- 26 , 2007 . I. Gamzu. Improved lower bounds for non-utilitarian truthfulness. In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, pages 15--26, 2007."},{"key":"e_1_3_2_1_12_1","first-page":"620","volume-title":"Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Goldberg A.V.","year":"2005","unstructured":"A.V. Goldberg and J.D. Hartline . Collusion-resistant mechanisms for single-parameter agents . In Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA) , pages 620 -- 629 . SIAM, 2005 . A.V. Goldberg and J.D. Hartline. Collusion-resistant mechanisms for single-parameter agents. In Proc. of the 16th Annual ACM Symposium on Discrete Algorithms (SODA), pages 620--629. SIAM, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321951"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.25"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/978-3-540-74456-6_41","volume-title":"Proceedings of the 32nd Mathematical Foundations of Computer Science (MFCS)","author":"Koutsoupias E.","year":"2007","unstructured":"E. Koutsoupias and A. Vidali . A lower bound of 1+\u03c6 for truthful scheduling mechanisms . In Proceedings of the 32nd Mathematical Foundations of Computer Science (MFCS) , Lecture Notes in Computer Science , pages 454 -- 464 , 2007 . E. Koutsoupias and A. Vidali. A lower bound of 1+\u03c6 for truthful scheduling mechanisms. In Proceedings of the 32nd Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, pages 454--464, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250947"},{"key":"e_1_3_2_1_18_1","first-page":"1143","volume-title":"Proc. of Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Mu'alem A.","year":"2007","unstructured":"A. Mu'alem and M. Schapira . Setting lower bounds on truthfulness . In Proc. of Annual ACM Symposium on Discrete Algorithms (SODA) , pages 1143 -- 1152 , 2007 . A. Mu'alem and M. Schapira. Setting lower bounds on truthfulness. In Proc. of Annual ACM Symposium on Discrete Algorithms (SODA), pages 1143--1152, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_59"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2618"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_5"},{"key":"e_1_3_2_1_24_1","author":"Vickrey W.","year":"1961","unstructured":"W. Vickrey . Counterspeculation, Auctions and Competitive Sealed Tenders . Journal of Finance, pages 8--37 , 1961 . W. Vickrey. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, pages 8--37, 1961.","journal-title":"Journal of Finance, pages 8--37"}],"event":{"name":"EC '09: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Stanford California USA","acronym":"EC '09"},"container-title":["Proceedings of the 10th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566396","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1566374.1566396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:10Z","timestamp":1750249390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":23,"alternative-id":["10.1145\/1566374.1566396","10.1145\/1566374"],"URL":"https:\/\/doi.org\/10.1145\/1566374.1566396","relation":{},"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}