Making eigenvector-based reputation systems robust to collusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3243, Issue , 2004, Pages 92-104

  Zhang, Hui ^a   Goel, Ashish ^b   Govindan, Ramesh ^a   Mason, Kahn ^b   Van Roy, Benjamin ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; RANDOM PROCESSES; SEARCH ENGINES; WEBSITES;

AMPLIFICATION FACTORS; EIGENVECTOR-BASED METHODS; EXHAUSTIVE SIMULATION; PAGERANK ALGORITHM; RANDOM WALK; REPUTATION SYSTEMS; SIMPLE MODIFICATIONS; USER RATING;

GRAPH ALGORITHMS;

EID: 35048868826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30216-2_8     Document Type: Article

References (18)

1. W. Aiello, F. Chung, and L. Lu. A Random Graph Model for Massive Graphs. the 32nd Annual Symposium on Theory of Computing, 2000.
2. K. Bharat, M. R. Henzinger. Improved Algorithms for Topic Distillation in a Hyperlinked Environment. Proceedings of SIGIR98, 1998.
3. B. Bollobas. Random Graphs. Academic Press, Inc. Orlando, Florida, 1985.
4. S. Chakrabarti, B. Dom, P. Raghavan, S. Rajagopalan, D. Gibson, J. Kleinberg. Automatic resource compilation by analyzing hyperlink structure and associated text. Proceeedings of the Seventh International Conference on World Wide Web, 1998.
5. C. Dellarocas. Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms. In Proceedings of the 3rd ACM Conference on Electronic Commerce, pages 171-179, 2001.
6. D. Dutta, A. Goel, R. Govindan, H. Zhang. The Design of A Distributed Rating Scheme for Peer-to-peer Systems. First Workshop on Economics of Peer-to-peer Systems, UC Berkeley, June 2003.
7. U. Feige and M. Seltser, On the densest k-subgraph problems. Technical report no. CS97-16, Department of Applied Math and Comp. Sci., Weizmann Institute, 1997.
8. Z. Gyongyi, H. Garcia-Molina, and J. Pedersen. Combating Web Spam with TrustRank. Technical Report, Stanford University, 2004.
9. T. Haveliwala. Topic-sensitive PageRank. In Proceedings of WWW2002, 2002.
10. S. Kamvar, M. Schlosser and H. Garcia-Molina. EigenRep: Reputation Management in P2P Networks, in Proc. WWW Conference, 2003.
11. J. M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, Vol.46, No.5, P604-632, 1999.
12. H.T. Kung, C.H. Wu. Differentiated Admission for Peer-to-Peer Systems: Incentivizing Peers to Contribute Their Resources. First Workshop on Economics of Peer-to-peer Systems, UC Berkeley, June 2003.
13. L. Li , Y. Shang , W. Zhang. Improvement of HITS-based algorithms on web documents. Proceedings of WWW2002, 2002.
14. N. Miller, P. Resnick, and R. Zeckhauser. Eliciting honest feedback in electronic markets. RWP02-39, Harvard Kennedy School of Government, 2002.
15. A. Y. Ng, A. X. Zheng, and M. I. Jordan. Link analysis, eigenvectors, and stability. International Joint Conference on Artificial Intelligence (IJCAI), 2001.
16. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Library Technologies Project, 1998.
17. The companion technical report is available at ftp://ftp.usc.edu/pub/ csinfo/techreports/papers/04-817.pdf
18. The Stanford WebBase Project. http://www-diglib.stanford.edu/testbed/ docS/ WebBase/