Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world's opinion of v's importance. In PageRank [4], u's own opinion can be seen to have considerable influence on her reputation, where v expresses a high opinion of herself by participating in short directed cycles. In contrast, we show that expected hitting time - the time to reach v in a random walk - measures essentially the same quantity as PageRank, but excludes v's opinion. We make these notions precise, and show that a reputation system based on hitting time resists tampering by individuals or groups who strategically place outlinks. We also present an algorithm to efficiently compute hitting time for all nodes in a massive graph; conventional algorithms do not scale adequately. © Springer-Verlag Berlin Heidelberg 12007.
CITATION STYLE
Hopcroft, J., & Sheldon, D. (2007). Manipulation-resistant reputations using hitting time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4863 LNCS, pp. 68–81). Springer Verlag. https://doi.org/10.1007/978-3-540-77004-6_6
Mendeley helps you to discover research relevant for your work.