Abstract
We propose a simple method of undoing tiebreaks in sport competitions with a large number of competitors and relatively small number of rounds of competition. Such methods are common in many games including Chess, Go, Bridge or Scrabble, among others. Tie-breaking methods decide in strict order the prizes to be received. One of the most commonly used methods is the well-known Buchholz method, based on the arithmetic mean of the scores obtained by the opponents. The alternative method that we propose in this paper, which is quite close to the median of the scores obtained by the opponents, is also a weighted average of the opponents’ scores, whose weights are based on the binomial distribution. The main objective of the article is to compare the proposed method with that of Buchholz, highlighting the many advantages over it.
Unfortunately, even today Buchholz’s method and its variants are routinely used as the first and second tiebreaker criteria. It is the used as a first and second criteria in the rapid and blitz chess world championships that took place in December 2021. We believe that Buchholz’s method should be replaced by the one proposed here as soon as possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Standard AGA Tournament Protocols. American Go Association. https://www.usgo.org/standard-aga-tournament-protocols
A.E. Elo. ‘8.4 Logistic Probability as a Rating Basis’, The Rating of Chessplayers, Past & Present. Bronx NY 10453: ISHI Press International (2008). ISBN 978-0-923891-27-5
EGF Tournament System Rules. European Go Federation. https://www.eurogofed.org/egf/tourrules.htm
Regulations for the FIDE Open World rapid & blitz championships. International Chess Federation (2021). https://www.fide.com/
FIDE Handbook, Appendix C, Section 11.5.3, 2021. International Chess Federation, 2018, come into force 2019
Freixas, J., Parker, C.: Manipulation in games with multiple levels of output. J. Math. Econ. 61, 144–151 (2015)
Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41, 587–601 (1973)
Golombek, H.: Golombek’s Encyclopedia of Chess, Crown (1977). ISBN 0-517-53146-1
Moulin, H.: On strategy-proofness and single peakedness. Econometrica 35(4), 437–455 (1980)
Satterthwaite, M.A.: Strategy-proofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187–217 (1975)
What is the Swiss System? Chess.about.com (2013). https://www.thesprucecrafts.com/the-swiss-system-611537
125 years Swiss System. en.chessbase.com (2014). https://en.chessbase.com/post/125-years-swiss-system
Swiss Pairing. Sensei’s Library. Nadunmi. https://senseis.xmp.net/?SwissPairing
Tukey, J.W.: Exploratory Data Analysis. Addison-Wesley, Reading (1977)
Women World Rapid Chess Championship 2021 chess-results.com (2021). https://chess-results.com/tnr600853.aspx?lan=1
World Rapid Chess Championship 2021 chess-results.com (2021). https://chess-results.com/tnr600852.aspx?lan=1
Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cybern. 18, 183–190 (1988)
Yager, R.R., Kacprzyk, J.: The Ordered Weighted Averaging Operators, Theory and Applications. Kluwer Academic Publishers (1997)
Acknowledgements
This research is part of the I+D+i project PID2019-104987GB-I00 supported by MCIN/AEI/10.13039/501100011033/
The author greatly appreciates the detailed comments of the two referees that have contributed to improve the revised version of this article. He also acknowledges the comments made on this article by Jordi Magem, Chess Grandmaster and FIDE Senior Trainer; Vladimir Zaiats, Mathematician and International Chess Arbiter; Josep M. Barón, Mathematician and FIDE Chess Master; and Juli Pérez, Mathematician and National Chess Master.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Freixas, J. (2022). The Decline of the Buchholz Tiebreaker System: A Preferable Alternative. In: Nguyen, N.T., Kowalczyk, R., Mercik, J., Motylska-Kuźma, A. (eds) Transactions on Computational Collective Intelligence XXXVII. Lecture Notes in Computer Science(), vol 13750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-66597-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-66597-8_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-66596-1
Online ISBN: 978-3-662-66597-8
eBook Packages: Computer ScienceComputer Science (R0)