Making eigenvector-based reputation systems robust to collusion

DOI10.1007/978-3-540-30216-2_8MaRDI QIDQ5311180zbMATH OpenOpenAlexFDO

Authors Hui Zhang, Ashish Goel, Ramesh Govindan, Kahn Mason, Benjamin Van Roy

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b101552

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Manipulation-resistant reputations using hitting time
• On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
• Manipulation-Resistant Reputations Using Hitting Time
• An analysis of optimal link bombs
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization

Cited in

(11)

• On the convergence of the minimally irreducible Markov chain method with applications to PageRank
• Comparison of Krylov subspace methods on the PageRank problem
• Algorithms and incentives for robust ranking
• Manipulation-resistant reputations using hitting time
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
• An analysis of optimal link bombs
• On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
• Manipulation-Resistant Reputations Using Hitting Time
• A preconditioning approach to the pagerank computation problem
• The design of a reliable reputation system
• An Arnoldi-extrapolation algorithm for computing pagerank

This page was built for publication: Making eigenvector-based reputation systems robust to collusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311180)