Improving ranking quality and fairness in Swiss-system chess tournaments

The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swisssystem chess tournaments and endorses computer programs that are able to calculate the prescribed pairings. The purpose of these formalities is to ensure that players are paired fairly during the tournament and that the final ranking corresponds to the players’ true strength order. We contest the official FIDE player pairing routine by presenting alternative pairing rules. These can be enforced by computing maximum weight matchings in a carefully designed graph. We demonstrate by extensive experiments that a tournament format using our mechanism 1) yields fairer pairings in the rounds of the tournament and 2) produces a final ranking that reflects the players’ true strengths better than the state-of-the-art FIDE pairing system.

[1]  Krishnendu Chatterjee,et al.  Robust Draws in Balanced Knockout Tournaments , 2016, IJCAI.

[2]  C. Spearman The proof and measurement of association between two things. , 2015, International journal of epidemiology.

[3]  G. Dirac Some Theorems on Abstract Graphs , 1952 .

[4]  Richard Hoshino,et al.  A Recursive Algorithm to Generate Balanced Weekend Tournaments , 2018, AAAI.

[5]  Robert W. Irving An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[6]  A. Elo The rating of chessplayers, past and present , 1978 .

[7]  F. Wilson May the best man win , 2014 .

[8]  Saket Saurabh,et al.  When Rigging a Tournament, Let Greediness Blind You , 2018, IJCAI.

[9]  Shane T. Jensen,et al.  Adaptive Paired Comparison Design , 2005 .

[10]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

[11]  J. Edmonds Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[12]  J. Hintze,et al.  Violin plots : A box plot-density trace synergism , 1998 .

[13]  Snjólfur Ólafsson Weighted Matching in Chess Tournaments , 1990 .

[14]  Virginia Vassilevska Williams,et al.  Fixing Tournaments for Kings, Chokers, and More , 2015, IJCAI.

[15]  Daniel J. Denis,et al.  The early origins and development of the scatterplot. , 2005, Journal of the history of the behavioral sciences.

[16]  Erkki Mäkinen,et al.  The Stable Roommates Problem and Chess Tournament Pairings , 1999 .

[17]  Wilfried Elmenreich,et al.  Robustness versus Performance in Sorting and Tournament Algorithms , 2009 .

[18]  M. Kendall The treatment of ties in ranking problems. , 1945, Biometrika.

[19]  Philip A. Scarf,et al.  A numerical study of designs for sporting contests , 2009, Eur. J. Oper. Res..

[20]  Karen Kafadar,et al.  Letter-Value Plots: Boxplots for Large Data , 2017 .

[21]  Mats Carlsson,et al.  An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-Robin Tournaments , 2014, CPAIOR.

[22]  Vladimir Kolmogorov,et al.  Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..