Impediments to Universal preference-based default theories
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Communications of the ACM
Conditional, hierarchical, multi-agent preferences
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Reputation systems: an axiomatic approach
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Ranking systems: the PageRank axioms
Proceedings of the 6th ACM conference on Electronic commerce
Journal of Artificial Intelligence Research
Complexity of mechanism design
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The computational complexity of choice sets
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Incentive compatible ranking systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Trust-based recommendation systems: an axiomatic approach
Proceedings of the 17th international conference on World Wide Web
Game-theoretic recommendations: some progress in an uphill battle
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Quantifying incentive compatibility of ranking systems
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Improved bounds for computing Kemeny rankings
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An axiomatic approach to personalized ranking systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Consistent Continuous Trust-Based Recommendation Systems
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
PageRank as a weak tournament solution
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Hybrid transitive trust mechanisms
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Voting in cooperative information agent scenarios: use and abuse
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
| Hi-index | 0.00 |
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. Each of these axioms can be individually satisfied. Moreover, we show a complete axiomatization of approval voting using one of these axioms.