A graph interpretation of the least squares ranking method
From MaRDI portal
Publication:2340263
DOI10.1007/s00355-014-0820-0zbMath1314.91091arXiv1508.06778OpenAlexW3103908477MaRDI QIDQ2340263
Publication date: 16 April 2015
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06778
Applications of statistics to economics (62P20) Decision theory (91B06) Applications of graph theory (05C90) Social choice (91B14) Paired and multiple comparisons; multiple testing (62J15)
Related Items (6)
Bayesian linear models for cardinal paired comparison data ⋮ Measuring centrality by a generalization of degree ⋮ On the ranking of a Swiss system chess team tournament ⋮ University rankings from the revealed preferences of the applicants ⋮ An impossibility theorem for paired comparisons ⋮ Graph-based estimators for paired comparison data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranking by pairwise comparisons for Swiss-system tournaments
- The walk distances in graphs
- Internal slackening scoring methods
- On optimal completion of incomplete pairwise comparison matrices
- Statistical ranking and combinatorial Hodge theory
- A least squares solution for paired comparisons with incomplete data
- Generalization of the row sum method for incomplete paired comparisons
- Ranking participants in tournaments by means of rating functions
- A survey on the complexity of tournament solutions
- The logarithmic least squares and the generalized pseudoinverse in estimating ratios
- Tournament solutions and majority voting
- Aggregation of preferences by the generalized row sum method
- Graph-theoretic interpretation of the generalized row sum method
- Characterizations of scoring methods for preference aggregation
- An iterative procedure for evaluating digraph competitions
- Monotonicity of `ranking by choosing': a progress report
- Forest matrices around the Laplacian matrix
- On proximity measures for graph vertices
- Paired comparisons analysis: an axiomatic approach to ranking methods
- The positional power of nodes in digraphs
- Eigenvalues of the Laplacian of a graph∗
- Ranking the Participants in a Tournament
- On Generalized Tournament Matrices
- Generalized inverse of the Laplacian matrix and some applications
- Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures
This page was built for publication: A graph interpretation of the least squares ranking method
