Abstract
In many chess tournaments the number of players is much larger than the number of rounds to be played. In such tournaments the pairing for a round depends on the results in earlier rounds. Many different systems have been constructed for these pairings. Two oommonly used systems are the Monrad system and the Swiss system though there exist a number of different variants of these two systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olafsson, S. (1989). Weighted Matching in Chess Tournaments. In: Wallace, S.W. (eds) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83724-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-83724-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83726-5
Online ISBN: 978-3-642-83724-1
eBook Packages: Springer Book Archive