{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:26:36Z","timestamp":1767677196386,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>We investigated the existence of fair seeding in knockout tournaments. We define two fairness criteria, both adapted from the literature: envy-freeness and order preservation. We show how to achieve the first criterion in tournaments whose structure is unconstrained, and prove an impossibility result for balanced tournaments. For the second criterion we have a similar result for unconstrained tournaments, but not for the balanced case. We provide instead a heuristic algorithm which we show through experiments to be efficient and effective. This suggests that the criterion is achievable also in balanced tournaments. However, we prove that it again becomes impossible to achieve when we add a weak condition guarding against the phenomenon of tournament dropout.<\/jats:p>","DOI":"10.1145\/2036264.2036273","type":"journal-article","created":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T20:56:02Z","timestamp":1350075362000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Fair Seeding in Knockout Tournaments"],"prefix":"10.1145","volume":"3","author":[{"given":"Thuc","family":"Vu","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Shoham","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2348901"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566379"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Groh C. Moldovanu B. Sela A. and Sunde U. 2009. Optimal seedings in elimination tournaments. Economic Theory. Groh C. Moldovanu B. Sela A. and Sunde U. 2009. Optimal seedings in elimination tournaments. Economic Theory .","DOI":"10.1007\/s00199-008-0356-6"},{"volume-title":"Proceedings of the 9th Bar-Ilan Symposium on the Foundations of Artificial Intelligence.","author":"Hazon N.","key":"e_1_2_1_4_1","unstructured":"Hazon , N. , Dunne , P. E. , Kraus , S. , and Wooldridge , M . 2007. How to rig an election . In Proceedings of the 9th Bar-Ilan Symposium on the Foundations of Artificial Intelligence. Hazon, N., Dunne, P. E., Kraus, S., and Wooldridge, M. 2007. How to rig an election. In Proceedings of the 9th Bar-Ilan Symposium on the Foundations of Artificial Intelligence."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.2.249"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1982.11995420"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.05.013"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1012081"},{"volume-title":"The predictive power of noisy elimination tournaments. Tech. rep","author":"Ryvkin D.","key":"e_1_2_1_9_1","unstructured":"Ryvkin , D. 2005. The predictive power of noisy elimination tournaments. Tech. rep ., Economic Institute , Prague . Ryvkin, D. 2005. The predictive power of noisy elimination tournaments. Tech. rep., Economic Institute, Prague."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2000.12005171"},{"volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910)","author":"Vu T.","key":"e_1_2_1_11_1","unstructured":"Vu , T. and Shoham , Y . 2010. Optimal seeding in knockout tournaments (extended abstract) . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910) . Vu, T. and Shoham, Y. 2010. Optimal seeding in knockout tournaments (extended abstract). In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910)."},{"volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909)","author":"Vu T.","key":"e_1_2_1_12_1","unstructured":"Vu , T. , Altman , A. , and Shoham , Y . 2009. On the complexity of schedule control problems for knockout tournaments . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909) . 225--232. Vu, T., Altman, A., and Shoham, Y. 2009. On the complexity of schedule control problems for knockout tournaments. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909). 225--232."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2036264.2036273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:29Z","timestamp":1750240109000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2036264.2036273"],"URL":"https:\/\/doi.org\/10.1145\/2036264.2036273","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}