An impossibility theorem for paired comparisons
- 66 Downloads
In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and multiple comparisons. In particular, two basic properties—independence of irrelevant matches and self-consistency—are considered. It is revealed that there exists no ranking method satisfying both requirements at the same time. The impossibility result holds under various restrictions on the set of ranking problems, however, it does not emerge in the case of round-robin tournaments. An interesting and more general possibility result is obtained by restricting the domain of independence of irrelevant matches through the concept of macrovertex.
KeywordsPreference aggregation Paired comparison Tournament ranking Axiomatic approach Impossibility
Mathematics Subject Classification15A06 91B14
We thank Sándor Bozóki for useful advice. Anonymous reviewers provided valuable comments and suggestions on earlier drafts. The research was supported by OTKA grant K 111797 and by the MTA Premium Post Doctorate Research Program.
- Chebotarev P (1989) Generalization of the row sum method for incomplete paired comparisons. Autom Remote Control 50(8):1103–1113Google Scholar
- Csató L (2018a) Some impossibilities of ranking in generalized tournaments. Manuscript. arXiv 1701:06539Google Scholar
- Csató L (2018b) Was Zidane honest or well-informed? How UEFA barely avoided a serious scandal. Econ Bull 38(1):152–158Google Scholar
- Landau E (1895) Zur relativen Wertbemessung der Turnierresultate. Deutsches Wochenschach 11:366–369Google Scholar
- Landau E (1914) Über Preisverteilung bei Spielturnieren. Z r Math Phys 63:192–202Google Scholar