License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1972
URL: http://drops.dagstuhl.de/opus/volltexte/2005/197/
Go to the corresponding Portal


Altman, Alon

The PageRank Axioms

pdf-format:
Document 1.pdf (297 KB)


Abstract

This talk introduces the first graph-theoretic, ordinal representation theorem for the PageRank algorithm, bridging the gap between page ranking algorithms and the formal theory of social choice.

BibTeX - Entry

@InProceedings{altman:DSP:2005:197,
  author =	{Alon Altman},
  title =	{The PageRank Axioms},
  booktitle =	{Computing and Markets},
  year =	{2005},
  editor =	{Daniel Lehmann and Rudolf M{\"u}ller and Tuomas Sandholm},
  number =	{05011},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/197},
  annote =	{Keywords: pagerank , social choice , ranking system}
}

Keywords: pagerank , social choice , ranking system
Seminar: 05011 - Computing and Markets
Issue Date: 2005
Date of publication: 19.07.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI