%0 Conference Paper %1 DBLP:conf/sigecom/AltmanT05 %A Altman, Alon %A Tennenholtz, Moshe %B ACM Conference on Electronic Commerce %D 2005 %E Riedl, John %E Kearns, Michael J. %E Reiter, Michael K. %I ACM %K graph.theory network_formulation pagerank %P 1-8 %R 10.1145/1064009.1064010 %T Ranking systems: the PageRank axioms %X This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and the exact rationale of page ranking algorithms we suggest the axiomatic approach taken in the formal theory of social choice. In this paper we deal with PageRank, the most famous page ranking algorithm. We present a set of simple (graph-theoretic, ordinal) axioms that are satisfied by PageRank, and moreover any page ranking algorithm that does satisfy them must coincide with PageRank. This is the first representation theorem of that kind, bridging the gap between page ranking algorithms and the mathematical theory of social choice.

@inproceedings{DBLP:conf/sigecom/AltmanT05, abstract = {This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and the exact rationale of page ranking algorithms we suggest the axiomatic approach taken in the formal theory of social choice. In this paper we deal with PageRank, the most famous page ranking algorithm. We present a set of simple (graph-theoretic, ordinal) axioms that are satisfied by PageRank, and moreover any page ranking algorithm that does satisfy them must coincide with PageRank. This is the first representation theorem of that kind, bridging the gap between page ranking algorithms and the mathematical theory of social choice.}, added-at = {2011-03-27T07:49:45.000+0200}, author = {Altman, Alon and Tennenholtz, Moshe}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/27cf965863717a8a359c7f2d8d6e7db80/ytyoun}, booktitle = {ACM Conference on Electronic Commerce}, crossref = {DBLP:conf/sigecom/2005}, doi = {10.1145/1064009.1064010}, editor = {Riedl, John and Kearns, Michael J. and Reiter, Michael K.}, interhash = {e527a8deccbfc8e8dc876f85b8263aa1}, intrahash = {7cf965863717a8a359c7f2d8d6e7db80}, keywords = {graph.theory network_formulation pagerank}, pages = {1-8}, publisher = {ACM}, timestamp = {2016-06-14T13:52:45.000+0200}, title = {Ranking systems: the PageRank axioms}, year = 2005 }