DagSemProc.05011.18.pdf
- Filesize: 297 kB
- 19 pages
Document
The PageRank Axioms
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5011
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-07-19
Cite AsGet BibTex
Alon Altman. The PageRank Axioms. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05011.18
https://doi.org/10.4230/DagSemProc.05011.18
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.
Keywords
- pagerank
- social choice
- ranking system
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads