Manipulation-Resistant Reputations Using Hitting Time

DOI10.1007/978-3-540-77004-6_6MaRDI QIDQ5458301zbMATH OpenOpenAlexFDO

Authors John Hopcroft, Daniel R. Sheldon

Publication date 11 April 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77004-6_6

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Manipulation-resistant reputations using hitting time
• Algorithms and Models for the Web-Graph
• Manipulation-resistant reputation systems
• On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
• Reputation games for undirected graphs

Cited in

(6)

• Algorithms and incentives for robust ranking
• Manipulation-resistant reputations using hitting time
• The web graph as an equilibrium
• Algorithms and Models for the Web-Graph
• On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
• A note on valid inequalities for PageRank optimization with edge selection constraints

This page was built for publication: Manipulation-Resistant Reputations Using Hitting Time

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