The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
A Theoretical Analysis of Google's PageRank
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Ranking systems: the PageRank axioms
Proceedings of the 6th ACM conference on Electronic commerce
SIAM Journal on Discrete Mathematics
The computational complexity of choice sets
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Computational aspects of covering in dominance graphs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the axiomatic foundations of ranking systems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
So who won?: dynamic max discovery with the crowd
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
We observe that ranking systems--a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz--and tournament solutions--a well-studied area of social choice theory--are strongly related. This relationship permits a mutual transfer of axioms and solution concepts. As a first step, we formally analyze a tournament solution that is based on Google's PageRank algorithm and study its interrelationships with common tournament solutions. It turns out that the PageRank set is always contained in both the Schwartz set and the uncovered set, but may be disjoint from most other tournament solutions. While PageRank does not satisfy various standard properties from the tournament literature, it can be much more discriminatory than established tournament solutions.