A graph interpretation of the least squares ranking method
From MaRDI portal
Publication:2340263
DOI10.1007/S00355-014-0820-0zbMATH Open1314.91091arXiv1508.06778OpenAlexW3103908477MaRDI QIDQ2340263FDOQ2340263
Authors: László Csató 
Publication date: 16 April 2015
Published in: Social Choice and Welfare (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1508.06778
Recommendations
Applications of statistics to economics (62P20) Applications of graph theory (05C90) Decision theory (91B06) Social choice (91B14) Paired and multiple comparisons; multiple testing (62J15)
Cites Work
- Title not available (Why is that?)
- Statistical ranking and combinatorial Hodge theory
- Eigenvalues of the Laplacian of a graph∗
- On optimal completion of incomplete pairwise comparison matrices
- Characterizations of scoring methods for preference aggregation
- Title not available (Why is that?)
- Generalized inverse of the Laplacian matrix and some applications
- Forest matrices around the Laplacian matrix
- Tournament solutions and majority voting
- An iterative procedure for evaluating digraph competitions
- The positional power of nodes in digraphs
- Ranking the Participants in a Tournament
- Title not available (Why is that?)
- Ranking by pairwise comparisons for Swiss-system tournaments
- The logarithmic least squares and the generalized pseudoinverse in estimating ratios
- Monotonicity of `ranking by choosing': a progress report
- The walk distances in graphs
- A survey on the complexity of tournament solutions
- On proximity measures for graph vertices
- Internal slackening scoring methods
- On Generalized Tournament Matrices
- Ranking participants in tournaments by means of rating functions
- Paired comparisons analysis: an axiomatic approach to ranking methods
- A least squares solution for paired comparisons with incomplete data
- Generalization of the row sum method for incomplete paired comparisons
- Aggregation of preferences by the generalized row sum method
- Graph-theoretic interpretation of the generalized row sum method
- Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures
Cited In (8)
- Graphical methods for ranking data
- On the ranking of a Swiss system chess team tournament
- Measuring centrality by a generalization of degree
- Bayesian linear models for cardinal paired comparison data
- Graph-based estimators for paired comparison data
- An impossibility theorem for paired comparisons
- Statistical ranking using the \(\ell^{1}\)-norm on graphs
- University rankings from the revealed preferences of the applicants
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)
