Name
Abstract | ||
|---|---|---|
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], v'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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-77004-6_6 | Internet Mathematics |
Keywords | DocType | Volume |
reputation system,random walk,massive graph,conventional algorithm,manipulation-resistant reputation,own opinion,popular reputation system,high opinion,considerable influence,node v | Journal | 5 |
Issue | ISSN | ISBN |
1 | 0302-9743 | 3-540-77003-8 |
Citations | PageRank | References |
20 | 0.97 | 25 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Hopcroft | 1 | 4245 | 1836.70 |
| Sheldon, Daniel R. | 2 | 180 | 23.15 |