並列摘要
The round-robin tournament is a widely used format. One of its main advantages is that it allows players to compete against each other, reducing the impact of luck and providing a complete ranking for players. The round-robin ranking problem is to determine a ranking that is considered optimal or widely accepted among the players based on the tournament results. The Elo rating system uses numerical values to represent the relative skill level of players, providing a method for evaluating their strengths. This rating system, which is commonly used in chess tournaments, updates the ratings of two players based on differences in their ratings and the outcome of the match. In this thesis, we try to utilize the Elo rating system for ranking round-robin tournaments and resolving some of the challenges posed by the original methods. In addition, we provide conjectures based on our observations and ongoing research.
參考文獻
I. Ali, W. D. Cook, and M. Kress. On the minimum violations ranking of a tournament. Management Science, 32(6):660–672, 1986
S. Bessy, F. V. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh, and S. Thomassé.Kernels for feedback arc set in tournaments. Journal of Computer and System Sci-ences, 77(6):1071–1078, 2011
R. Chetrite, R. Diel, and M. Lerasle. The number of potential winners in bradleyterry model in random environment. The Annals of Applied Probability, 27(3):13721394, 2017
A. E. Elo. The Rating of Chessplayers, Past and Present. Arco Pub., Inc., New York, 1978
M. E. Glickman and A. C. Jones. Rating the chess rating system. Chance, 12(2):21–28, 1999