{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:08:09Z","timestamp":1785038889492,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CCS-1717899"],"award-info":[{"award-number":["CCS-1717899"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538242","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1082-1100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximately Strategyproof Tournament Rules with Multiple Prizes"],"prefix":"10.1145","author":[{"given":"Emily","family":"Dale","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jessica","family":"Fielding","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hari","family":"Ramakrishnan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sacheth","family":"Sathyanarayanan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7613"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1661445.1661451"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00649265"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984"},{"key":"e_1_3_2_1_5_1","volume-title":"European qualifiers 2018 FIFA world cup qualification can be manipulated. 09","author":"Csato Laszlo","year":"2017","unstructured":"Laszlo Csato . European qualifiers 2018 FIFA world cup qualification can be manipulated. 09 2017 . Laszlo Csato. European qualifiers 2018 FIFA world cup qualification can be manipulated. 09 2017."},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference","volume":"185","author":"Ding Kimberly","year":"2021","unstructured":"Kimberly Ding and S. Matthew Weinberg . Approximately strategyproof tournament rules in the probabilistic setting. In James R. Lee, editor , 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference , volume 185 of LIPIcs, pages 14: 1 -- 14 :20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2021 . Kimberly Ding and S. Matthew Weinberg. Approximately strategyproof tournament rules in the probabilistic setting. In James R. Lee, editor, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference, volume 185 of LIPIcs, pages 14:1--14:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0133030"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2324486"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10037"},{"key":"e_1_3_2_1_10_1","first-page":"561","volume-title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015","author":"Michael","year":"2015","unstructured":"Michael P. Kim and Virginia Vassilevska Williams. Fixing tournaments for kings, chokers, and more . In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 , Buenos Aires, Argentina, July 25--31 , 2015 , pages 561 -- 567 , 2015. Michael P. Kim and Virginia Vassilevska Williams. Fixing tournaments for kings, chokers, and more. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25--31, 2015, pages 561--567, 2015."},{"key":"e_1_3_2_1_11_1","volume-title":"Germany), 7","author":"Laslier J.F.","year":"1997","unstructured":"J.F. Laslier . Tournament Solutions and Majority Voting. Studies in Economic Theory (Berlin , Germany), 7 . Springer , 1997 . J.F. Laslier. Tournament Solutions and Majority Voting. Studies in Economic Theory (Berlin, Germany), 7. Springer, 1997."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1993.1010"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2110925"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-013-0767-6"},{"key":"e_1_3_2_1_15_1","volume-title":"8th Innovations in Theoretical Computer Science Conference, ITCS 2017","author":"Schneider Jon","year":"2017","unstructured":"Jon Schneider , Ariel Schvartzman , and S. Matthew Weinberg . Condorcet-consistent and approximately strategyproof tournament rules . In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017 , January 9 --11 , 2017 , Berkeley, CA, USA, pages 35:1--35:20, 2017. Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg. Condorcet-consistent and approximately strategyproof tournament rules. In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9--11, 2017, Berkeley, CA, USA, pages 35:1--35:20, 2017."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/2110787"},{"key":"e_1_3_2_1_17_1","first-page":"357","volume-title":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence","author":"Stanton Isabelle","year":"2011","unstructured":"Isabelle Stanton and Virginia Vassilevska Williams . Rigging tournament brackets for weaker players . In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence , Barcelona, Catalonia, Spain, July 16--22 , 2011 , pages 357 -- 364 , 2011. Isabelle Stanton and Virginia Vassilevska Williams. Rigging tournament brackets for weaker players. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16--22, 2011, pages 357--364, 2011."},{"key":"e_1_3_2_1_18_1","first-page":"1","volume-title":"11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12--14","volume":"151","author":"Schvartzman Ariel","year":"2020","unstructured":"Ariel Schvartzman , S. Matthew Weinberg , Eitan Zlatin , and Albert Zuo . Approximately strategyproof tournament rules: On large manipulating sets and cover-consistence. In Thomas Vidick, editor , 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12--14 , 2020 , Seattle, Washington, USA , volume 151 of LIPIcs, pages 3: 1 -- 3 :25. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2020. Ariel Schvartzman, S. Matthew Weinberg, Eitan Zlatin, and Albert Zuo. Approximately strategyproof tournament rules: On large manipulating sets and cover-consistence. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12--14, 2020, Seattle, Washington, USA, volume 151 of LIPIcs, pages 3:1--3:25. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2020."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2898607.2898751"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538242","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":19,"alternative-id":["10.1145\/3490486.3538242","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538242","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}