Sziklai, Balázs, Biró, Péter and Csató, László ORCID: https://orcid.org/0000-0001-8705-5036 (2022) The efficacy of tournament designs. Computers and Operations Research, 144 . DOI https://doi.org/10.1016/j.cor.2022.105821
|
PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
2MB |
Official URL: https://doi.org/10.1016/j.cor.2022.105821
Abstract
Tournaments are a widely used mechanism to rank alternatives in a noisy environment. This paper investigates a fundamental issue of economics in tournament design: what is the best usage of limited resources, that is, how should the alternatives be compared pairwise to best approximate their true but latent ranking. We consider various formats including knockout tournaments, multi-stage championships consisting of round-robin groups followed by single elimination, and the Swiss-system. They are evaluated via Monte-Carlo simulations under six different assumptions on winning probabilities. Comparing the same pair of alternatives multiple times turns out to be an inefficacious policy. While seeding can increase the efficacy of the knockout and groupbased designs, its influence remains marginal unless one has an unrealistically good estimation on the true ranking of the players. The Swiss-system is found to be the most accurate among all these tournament formats, especially in its ability to rank all participants. A possible explanation is that it does not eliminate a player after a single loss, while it takes the history of the comparisons into account. The results can be especially interesting for emerging esports, where the tournament designs are not yet solidified.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | competitive balance, OR in sports, ranking, simulation, tournament design |
Subjects: | Culture, sport |
DOI: | https://doi.org/10.1016/j.cor.2022.105821 |
ID Code: | 7522 |
Deposited By: | MTMT SWORD |
Deposited On: | 12 Jul 2022 14:03 |
Last Modified: | 12 Jul 2022 14:03 |
Repository Staff Only: item control page