Journal of Quantitative Analysis in Sports · 2024 · 11 citations · 35 references
Social SciencesDecision SciencesDecision AnalysisFormal MethodsGame TheoryMatching TheoryMechanism DesignRanking ProblemsFair RankingPairwise VotingRanking FairnessStrengths ProfilingTournament RankingTournaments Theory
Abstract The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swiss-system 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.
35
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
Violin Plots: A Box Plot-Density Trace Synergism
Jerry L. Hintze, Ray D. Nelson · The American Statistician · 1998 · 1.6K citations
Some Theorems on Abstract Graphs
G. A. Dirac · Proceedings of the London Mathematical Society · 1952 · 1.6K citations
THE TREATMENT OF TIES IN RANKING PROBLEMS
Biometrika · 1945 · 682 citations