DMCA
On the axiomatic foundations of ranking systems (2005)
Cached
Download Links
| Venue: | In Proc. 19th International Joint Conference on Artificial Intelligence |
| Citations: | 45 - 9 self |
BibTeX
@INPROCEEDINGS{Altman05onthe,
author = {Alon Altman and Moshe Tennenholtz},
title = {On the axiomatic foundations of ranking systems},
booktitle = {In Proc. 19th International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {917--922}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent systems. When the set of agents and the set of alternatives coincide, we get the ranking systems setting. A famous type of ranking systems are page ranking systems in the context of search engines. In this paper we present an extensive axiomatic study of ranking systems. In particular, we consider two fundamental axioms: Transitivity, and Ranked Independence of Irrelevant Alternatives. Surprisingly, we find that there is no general social ranking rule that satisfies both requirements. Furthermore, we show that our impossibility result holds under various restrictions on the class of ranking problems considered. However, when transitivity is weakened, an interesting possibility result is obtained. In addition, we show a complete axiomatization of approval voting using ranked IIA. 1
Keyphrases
axiomatic foundation agent preference famous type multi-agent system irrelevant alternative various restriction approval voting complete axiomatization fundamental axiom impossibility result fundamental issue ranking system interesting possibility result extensive axiomatic study search engine general social ranking rule social ranking
