Manipulation-resistant reputations using hitting time

DOI10.1080/15427951.2008.10129303MaRDI QIDQ3078598zbMATH OpenOpenAlexFDO

Authors John Hopcroft, Daniel R. Sheldon

Publication date 28 February 2011

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1259158598

Mathematics Subject Classification ID

Internet topics (68M11) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

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

(7)

• Hitting times in Markov chains with restart and their application to network centrality
• Algorithms and incentives for robust ranking
• Manipulation-resistant reputation systems
• Algorithms and Models for the Web-Graph
• Countering web spam with credibility-based link analysis
• Manipulation-Resistant Reputations Using Hitting Time
• The buck-passing game

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 Q3078598)