An impossibility theorem for paired comparisons

DOI10.1007/S10100-018-0572-5MaRDI QIDQ2418166zbMATH OpenOpenAlexWikidataFDO

Authors László Csató

Publication date 3 June 2019

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.00186

zbMATH Keywords

axiomatic approachimpossibilitypaired comparisonpreference aggregationtournament ranking

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Operations research and management science (90Bxx) Social choice (91B14)

Recommendations

• Some impossibilities of ranking in generalized tournaments
• Paired comparisons analysis: an axiomatic approach to ranking methods
• Ranking from unbalanced paired-comparison data
• Seeking consistency with paired comparisons: a systems approach
• scientific article; zbMATH DE number 4072701

Cites work

• A graph interpretation of the least squares ranking method
• A proof technique for social choice with variable electorate
• Aggregation of preferences by the generalized row sum method
• An application of incomplete pairwise comparison matrices for ranking top tennis players
• Axiomatic foundations for ranking systems
• Characterizations of scoring methods for preference aggregation
• Generalization of the row sum method for incomplete paired comparisons
• scientific article; zbMATH DE number 1086759 (Why is no real title available?)
• Jie Ke versus AlphaGo: a ranking approach using decision making method for large-scale data with incomplete information
• On optimal completion of incomplete pairwise comparison matrices
• On the ranking of a Swiss system chess team tournament
• 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 methods based on valued preference relations. A characterization of the net flow method
• Ranking the Participants in a Tournament
• Some impossibilities of ranking in generalized tournaments
• The Copeland choice function. An axiomatic characterization

Cited in

(15)

• Impossibility results for choice correspondences
• How to identify experts in a community?
• Fair elimination-type competitions
• Lexicographic solutions for coalitional rankings
• University rankings from the revealed preferences of the applicants
• Monotonicity in sharing the revenues from broadcasting sports leagues
• On the ranking of a Swiss system chess team tournament
• An impossibility theorem for verisimilitude
• IMPOSSIBILITY THEOREMS ON MUTUAL EVALUATION
• Some impossibilities of ranking in generalized tournaments
• Editorial
• Tournament design: a review from an operational research perspective
• The Copeland ratio ranking method for abstract decision problems
• The Inversion Paradox and Ranking Methods in Tournaments
• A Monte Carlo framework for procedural fixture fairness evaluation in league competitions

Describes a project that uses

Uses Software

• AlphaGo

This page was built for publication: An impossibility theorem for paired comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418166)