Abstract
We study competitions structured as hierarchically shaped single elimination tournaments. We define optimal tournaments by maximizing attractiveness such that topmost players will have the chance to meet in higher stages of the tournament. We propose a dynamic programming algorithm for computing optimal tournaments and we provide its sound complexity analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bao, N.P.H., Xiong, S., Iida, H.: Reaper tournament system. In: Chisik, Y., Holopainen, J., Khaled, R., Luis Silva, J., Alexandra Silva, P. (eds.) INTETAIN 2017. LNICST, vol. 215, pp. 16–33. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73062-2_2
CodeChef: Tennis tournament (2012). https://www.codechef.com/COOK27/problems/TOURNAM. Accessed 21 March 2021
Dutka, J.: The early history of the factorial function. Arch. Hist. Exact Sci. 43(3), 225–249 (1991). https://doi.org/10.1007/BF00389433
Hartigan, J.A.: Probabilistic completion of a knockout tournament. Ann. Math. Stat. 37(2), 495–503 (1966). https://doi.org/10.1214/aoms/1177699533
Maurer, W.: On most effective tournament plans with fewer games than competitors. Ann. Stat. 3(3), 717–727 (1975). https://doi.org/10.1214/aos/1176343135
Vu, T., Shoham, Y.: Fair seeding in knockout tournaments. ACM Trans. Intell. Syst. Technol. 3(1), 9:1–9:17 (2011). https://doi.org/10.1145/2036264.2036273
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Bădică, A., Bădică, C., Buligiu, I., Ciora, L.I., Logofătu, D. (2022). Optimal Knockout Tournaments: Definition and Computation. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2021. Lecture Notes in Computer Science, vol 13127. Springer, Cham. https://doi.org/10.1007/978-3-030-97549-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-97549-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97548-7
Online ISBN: 978-3-030-97549-4
eBook Packages: Computer ScienceComputer Science (R0)