Ranking by pairwise comparisons for Swiss-system tournaments
arXiv:1508.06773 · doi:10.1007/s10100-012-0261-8
Abstract
Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely proposing alternative rankings for the 2010 Chess Olympiad Open tournament. It is shown that results are robust regarding scaling technique. In order to compare different rankings, a distance function is introduced with the aim of taking into account the subjective nature of human perception. Analysis of the weight vectors implies that methods based on pairwise comparisons have common roots. Visualization of the results is provided by Multidimensional Scaling on the basis of the defined distance. The proposed rankings give in some cases intuitively better outcome than currently used lexicographical orders.
Cited by in corpus (22)
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- On the ranking of a Swiss system chess team tournament
- The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
- A characterization of the Logarithmic Least Squares Method
- The efficacy of tournament designs
- A simulation comparison of tournament designs for the World Men's Handball Championships
- Tournament design: A review from an operational research perspective
- Axiomatizations of inconsistency indices for triads
- Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
- Club coefficients in the UEFA Champions League: Time for shift to an Elo-based formula
- An alternative quality of life ranking on the basis of remittances
- A graph interpretation of the least squares ranking method
- Revenue allocation in Formula One: a pairwise comparison approach
- Entropy production rate as a criterion for inconsistency in decision theory
- An impossibility theorem for paired comparisons
- A lexicographically optimal completion for pairwise comparison matrices with missing entries
- How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result
- On the coincidence of optimal completions for small pairwise comparison matrices with missing entries
- Inconsistency thresholds for incomplete pairwise comparison matrices
- Matrices of forests, analysis of networks, and ranking problems
- Optimal sequences for pairwise comparisons: the graph of graphs approach
- Incomplete Analytic Hierarchy Process with Minimum Weighted Ordinal Violations