Manipulation-Resistant Reputations Using Hitting Time

DOI10.1007/978-3-540-77004-6_6zbMath1136.68330OpenAlexW2037242246MaRDI QIDQ5458301

Daniel R. Sheldon, John E. Hopcrofts

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)

Related Items (2)

The Web Graph as an Equilibrium ⋮ On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games

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