{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:49Z","timestamp":1750306369484,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T00:00:00Z","timestamp":1469059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Greek Secretariat for Research and Technology","award":["THALES-DELUGE"],"award-info":[{"award-number":["THALES-DELUGE"]}]},{"name":"NSF","award":["CCF-1101491"],"award-info":[{"award-number":["CCF-1101491"]}]},{"name":"Simons Foundation","award":["Award for Graduate Students in Theoretical Computer Science"],"award-info":[{"award-number":["Award for Graduate Students in Theoretical Computer Science"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,21]]},"DOI":"10.1145\/2940716.2940743","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T15:20:09Z","timestamp":1469114409000},"page":"771-788","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Mechanism Design with Selective Verification"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manolis","family":"Zampetakis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0457"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386796"},{"volume-title":"Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA '07)","author":"Arthur D.","key":"e_1_3_2_1_3_1","unstructured":"D. Arthur and S. Vassilvitskii . 2007. k-means++: the advantages of careful seeding . In Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA '07) . 1027--1035. D. Arthur and S. Vassilvitskii. 2007. k-means++: the advantages of careful seeding. In Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA '07). 1027--1035."},{"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.1257\/aer.104.12.3779"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229035"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482582"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993656"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/090780146"},{"key":"e_1_3_2_1_10_1","unstructured":"A. Erlanson and A. Kleiner. 2015. Costly Verification in Collective Decisions. Working Paper (2015).  A. Erlanson and A. Kleiner. 2015. Costly Verification in Collective Decisions. Working Paper (2015)."},{"volume-title":"Proc. of the 10th Workshop on Internet and Network Economics (WINE '14)","author":"Filos-Ratsikas A.","key":"e_1_3_2_1_11_1","unstructured":"A. Filos-Ratsikas and P.B. Miltersen . 2014. Truthful Approximations to Range Voting . In Proc. of the 10th Workshop on Internet and Network Economics (WINE '14) , (LNCS) 8877. 175--188. A. Filos-Ratsikas and P.B. Miltersen. 2014. Truthful Approximations to Range Voting. In Proc. of the 10th Workshop on Internet and Network Economics (WINE '14), (LNCS) 8877. 175--188."},{"volume-title":"International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'14)","author":"Fotakis D.","key":"e_1_3_2_1_12_1","unstructured":"D. Fotakis , P. Krysta , and C. Ventre . 2014. Combinatorial Auctions without Money . In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'14) . 1029--1036. D. Fotakis, P. Krysta, and C. Ventre. 2014. Combinatorial Auctions without Money. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'14). 1029--1036."},{"key":"e_1_3_2_1_13_1","first-page":"85","article-title":"Efficient Money Burning in General Domains. In Proc. of the 8th Symposium on Algorithmic Game Theory (SAGT'15)","volume":"9347","author":"Fotakis D.","year":"2015","unstructured":"D. Fotakis , D. Tsipras , C. Tzamos , and E. Zampetakis . 2015 a. Efficient Money Burning in General Domains. In Proc. of the 8th Symposium on Algorithmic Game Theory (SAGT'15) , LNCS 9347. 85 -- 97 . D. Fotakis, D. Tsipras, C. Tzamos, and E. Zampetakis. 2015a. Efficient Money Burning in General Domains. In Proc. of the 8th Symposium on Algorithmic Game Theory (SAGT'15), LNCS 9347. 85--97.","journal-title":"LNCS"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482595"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.11.036"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2665005"},{"key":"e_1_3_2_1_17_1","unstructured":"D. Fotakis C. Tzamos and E. Zampetakis. 2015b. Who to Trust for Truthfully Maximizing Welfare? CoRR abs\/1507.02301 (2015).  D. Fotakis C. Tzamos and E. Zampetakis. 2015b. Who to Trust for Truthfully Maximizing Welfare? CoRR abs\/1507.02301 (2015)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2790086"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2004.00551.x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374390"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.36"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.001"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049699"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807393"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090254"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_1_27_1","first-page":"255","article-title":"Mechanisms for Hiring a Matroid Base without Money. In Proc. of the 7th International Symposium on Algorithmic Game Theory (SAGT'14)","volume":"8768","author":"Pountourakis E.","year":"2014","unstructured":"E. Pountourakis and G. Schafer . 2014 . Mechanisms for Hiring a Matroid Base without Money. In Proc. of the 7th International Symposium on Algorithmic Game Theory (SAGT'14) , LNCS 8768. 255 -- 266 . E. Pountourakis and G. Schafer. 2014. Mechanisms for Hiring a Matroid Base without Money. In Proc. of the 7th International Symposium on Algorithmic Game Theory (SAGT'14), LNCS 8768. 255--266.","journal-title":"LNCS"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2542174.2542175"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_41"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1129"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(79)90031-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"D.P. Williamson and D.B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge Univ. Press.   D.P. Williamson and D.B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge Univ. Press.","DOI":"10.1017\/CBO9780511921735"}],"event":{"name":"EC '16: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Maastricht The Netherlands","acronym":"EC '16"},"container-title":["Proceedings of the 2016 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940743","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:27Z","timestamp":1750222587000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,21]]},"references-count":32,"alternative-id":["10.1145\/2940716.2940743","10.1145\/2940716"],"URL":"https:\/\/doi.org\/10.1145\/2940716.2940743","relation":{},"subject":[],"published":{"date-parts":[[2016,7,21]]},"assertion":[{"value":"2016-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}