PageRank as a Weak Tournament Solution

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.

[1]  Moshe Tennenholtz,et al.  On the Axiomatic Foundations of Ranking Systems , 2005, IJCAI.

[2]  H. Daniels.  Round-robin tournament scores , 1969 .

[3]  Bhaskar Dutta,et al.  Comparison functions and choice correspondences , 1999 .

[4]  Giora Slutzki,et al.  Scoring of web pages and tournaments—axiomatizations , 2006, Soc. Choice Welf..

[5]  H. Moulin.  Choosing from a tournament , 1986 .

[6]  Oscar Volij,et al.  The Measurement of Intellectual Influence , 2002 .

[7]  J. Moon,et al.  On Generalized Tournament Matrices , 1970 .

[8]  Gerhard J. Woeginger,et al.  Banks winners in tournaments are difficult to recognize , 2003, Soc. Choice Welf..

[9]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[10]  Noga Alon,et al.  Ranking Tournaments , 2006, SIAM J. Discret. Math..

[11]  Felix A. Fischer,et al.  The Computational Complexity of Choice Sets , 2007, TARK '07.

[12]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[13]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[14]  Begoña Subiza,et al.  Condorcet choice correspondences for weak tournaments , 1999 .

[15]  Luca Pretto,et al.  A Theoretical Analysis of Google's PageRank , 2002, SPIRE.

[16]  Sebastiano Vigna,et al.  PageRank as a function of the damping factor , 2005, WWW '05.

[17]  Felix A. Fischer,et al.  Computational Aspects of Covering in Dominance Graphs , 2007, AAAI.

[18]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[19]  Jean-François Laslier,et al.  Tournament Solutions And Majority Voting , 1997 .