A graph interpretation of the least squares ranking method
From MaRDI portal
Publication:2340263
Abstract: The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may reflect the outcomes of a sport competition, product comparisons, or evaluation of political candidates and policies. It is shown that the rating vector can be obtained as a limit point of an iterative process based on the scores in almost all cases. The calculation is interpreted on an undirected graph with loops attached to some nodes, revealing that the procedure takes into account not only the given object's results but also the strength of objects compared with it. We explore the connection between this method and another procedure defined for ranking the nodes in a digraph, the positional power measure. The decomposition of the least squares solution offers a number of ways to modify the method.
Recommendations
Cites work
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3373921 (Why is no real title available?)
- A least squares solution for paired comparisons with incomplete data
- A survey on the complexity of tournament solutions
- Aggregation of preferences by the generalized row sum method
- An iterative procedure for evaluating digraph competitions
- Characterizations of scoring methods for preference aggregation
- Eigenvalues of the Laplacian of a graph∗
- Forest matrices around the Laplacian matrix
- Generalization of the row sum method for incomplete paired comparisons
- Generalized inverse of the Laplacian matrix and some applications
- Graph-theoretic interpretation of the generalized row sum method
- Internal slackening scoring methods
- Monotonicity of `ranking by choosing': a progress report
- On Generalized Tournament Matrices
- On optimal completion of incomplete pairwise comparison matrices
- On proximity measures for graph vertices
- Paired comparisons analysis: an axiomatic approach to ranking methods
- Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures
- Ranking by pairwise comparisons for Swiss-system tournaments
- Ranking participants in tournaments by means of rating functions
- Ranking the Participants in a Tournament
- Statistical ranking and combinatorial Hodge theory
- The logarithmic least squares and the generalized pseudoinverse in estimating ratios
- The positional power of nodes in digraphs
- The walk distances in graphs
- Tournament solutions and majority voting
Cited in
(8)- Bayesian linear models for cardinal paired comparison data
- An impossibility theorem for paired comparisons
- Statistical ranking using the \(\ell^{1}\)-norm on graphs
- Measuring centrality by a generalization of degree
- Graphical methods for ranking data
- Graph-based estimators for paired comparison data
- University rankings from the revealed preferences of the applicants
- On the ranking of a Swiss system chess team tournament
This page was built for publication: A graph interpretation of the least squares ranking method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340263)
