Abstract
This paper explores a novel way for analyzing tournament structures. Our goal is to find the best suitable tournament under considered purposes. Aside from the number of matches, we address on two other important aspects: competitiveness development and ranking precision. Competitiveness development emphasizes the importance participants’ motivation in every match while keeping the matches exciting throughout the tournament. Ranking precision reflects the credibility of tournament results, so that prizes can be distributed with minimum complains and dissatisfaction. To address competitiveness development, this paper proposes a new method which visualizes tournament structures as a tree using graphical model approach, which we call progress tree. Considering the similarities of sorting algorithm with the ranking process, ranking precision is discussed based on the quality of algorithm for the ranking task. This paper also analyzes well known tournament structures such as single elimination, double elimination, round robin and Swiss system. The performed analysis reveals the strength and weakness of each tournament structure. Although each tournament has its own pros and cons, none of them can convince the tournament results for all participants while keeping the matches strongly motivating thoroughly. Thus, a new tournament structure called reaper tournament system is proposed in this paper to meet those requirements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In this paper, we assume that a match can only result in a win or a loss.
References
algolist.net. Selection sort (java, c++)—algorithms and data structures (2015). http://www.algolist.net/Algorithms/Sorting/Selection_sort. Accessed 14 Aug 2015
Brejov, B.: Analyzing variants of shellsort. Inf. Process. Lett. 79(5), 223–227 (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
dota2.com. Main event - statitics - asia championships - dota2 (2015). http://dac.dota2.com.cn/statistical/main.htm. Accessed 12 Aug 2015
dota2.com. Dota 2 - the international (2016). http://www.dota2.com/international/replays/4/1/. Accessed 1 Feb 2017
Elo, A.: The Rating of Chess Players, Past and Present. Arco Publishing, New York (1975)
Han, Y.: Deterministic sorting in O (n log log n) time and linear space. J. Algorithms 50(1), 96–105 (2004)
Han, Y., Thorup, M.: Integer sorting in O(n radic;(log log n)) expected time and linear space. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 135–144 (2002)
Kaiser, E., Feng, W.C.: Playerrating: a reputation system for multiplayer online games. In: 2009 8th Annual Workshop on Network and Systems Support for Games (NetGames), pp. 1–6, November 2009
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3, 2nd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)
Graepel, T., Herbrich, R., Minka, T.: \({\rm Trueskill}^{\rm (TM)}\): a Bayesian skill rating system. In: Advances in Neural Information Processing Systems, vol. 20, pp. 569–576. MIT Press, Cambridge, January 2007
Graepel, T., Herbrich, R., Minka, T.: Trueskill through time: revisiting the history of chess. In: Advances in Neural Information Processing Systems, vol. 20, pp. 931–938. MIT Press, Cambridge, January 2008
Sanderson, A.R., Siegfried, J.J.: Thinking about competitive balance. J. Sports Econ. 4, 255–279 (2003)
Schmidt, M.B., Berri, D.J.: Competitive balance and attendance: the case of major league baseball. J. Sports Econ. 2, 145–167 (2001)
Sedgewick, R.: Implementing quicksort programs. Commun. ACM 21(10), 847–857 (1978)
Shim, K.J., Ahmad, M.A., Pathak, N., Srivastava, J.: Inferring player rating from performance data in massively multiplayer online role-playing games (MMORPGS). In: International Conference on Computational Science and Engineering, CSE 2009, vol. 4, pp. 1199–1204, August 2009
Sucar, L.E.: Graph theory. Probabilistic Graphical Models. ACVPR, pp. 27–38. Springer, London (2015). https://doi.org/10.1007/978-1-4471-6699-3_3
Szymanski, S.: Income inequality, competitive balance and the attractiveness of team sports: some evidence and a natural experiment from English soccer. Econ. J. 111, 69–84 (2001). 108 Cowley, Oxford OX4 IJF, UK and 350 Main Street, Maiden, MA 20148, USA (2001). Blacwell Publisher
Thorup, M.: Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algorithms 42(2), 205–230 (2002)
Zhang, L., Wu, J., Wang, Z.C., Wang, C.J.: A factor-based model for context-sensitive skill rating systems. In: 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, vol. 2, pp. 249–255, October 2010
Acknowledgment
We thank Dr. T. Takizawa for showing us the Swiss tournament system sample code, it was really helpful for our understanding.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Bao, N.P.H., Xiong, S., Iida, H. (2018). Reaper Tournament System. In: Chisik, Y., Holopainen, J., Khaled, R., Luis Silva, J., Alexandra Silva, P. (eds) Intelligent Technologies for Interactive Entertainment. INTETAIN 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 215. Springer, Cham. https://doi.org/10.1007/978-3-319-73062-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-73062-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73061-5
Online ISBN: 978-3-319-73062-2
eBook Packages: Computer ScienceComputer Science (R0)