Algorithmic Game Theory: Manipulation-Resistant Reputation Systems

This chapter is an overview of the design and analysis of reputation systems for strategic users. We consider three specific strategic threats to reputation systems: the possibility of users with poor reputations starting afresh (whitewashing); lack of effort or honesty in providing feedback; and sybil attacks, in which users create phantom feedback from fake identities to manipulate their own reputation. In each case, we present a simple analytical model that captures the essence of the strategy, and describe approaches to solving the strategic problem in the context of this model. We conclude with a discussion of open questions in this research area. 1.1 Introduction: Why are reputation systems important? One of the major benefits of the Internet is that it enables potentially beneficial interactions, both commercial and non-commercial, between people, organizations, or computers that do not share any other common context. The actual value of an interaction, however, depends heavily on the ability and reliability of the entities involved. For example, an online shopper may obtain better or lower-cost items from remote traders, but she may also be defrauded by a low quality product for which redress (legal or otherwise) is difficult. If each entity's history of previous interactions is made visible to potential new interaction partners, several benefits ensue. First, a history may reveal information about an entity's ability, allowing others to make choices about whether to interact with that entity, and on what terms. Second, an expectation that current performance will be visible in the future may deter moral hazard in the present, that hazard being the temptation to cheat or exert low effort. In other words, visible histories create an incentive to 4

[1]  David M. Kreps,et al.  Reputation and imperfect information , 1982 .

[2]  Paul R. Milgrom,et al.  Predation, reputation, and entry deterrence☆ , 1982 .

[3]  D. Fudenberg,et al.  Reputation and Equilibrium Selection in Games with a Patient Player , 1989 .

[4]  R. Cooke Experts in Uncertainty: Opinion and Subjective Probability in Science , 1991 .

[5]  Michihiro Kandori Social Norms and Community Enforcement , 1992 .

[6]  Steven Tadelis,et al.  What's in a Name? Reputation as a Tradeable Asset , 1998 .

[7]  R. Selten Axiomatic Characterization of the Quadratic Scoring Rule , 1998 .

[8]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[9]  E. Friedman,et al.  The Social Cost of Cheap Pseudonyms , 2001 .

[10]  Chrysanthos Dellarocas,et al.  Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms , 2011, EC '01.

[11]  Steve Chien,et al.  Link Evolution: Analysis and Algorithms , 2004, Internet Math..

[12]  Chrysanthos Dellarocas,et al.  The Digitization of Word-of-Mouth: Promise and Challenges of Online Feedback Mechanisms , 2003, Manag. Sci..

[13]  Ramesh Govindan,et al.  Making Eigenvector-Based Reputation Systems Robust to Collusion , 2004, WAW.

[14]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[15]  Ashish Goel,et al.  Avoiding ballot stuffing in eBay-like reputation systems , 2005, P2PECON '05.

[16]  Robert D. Kleinberg,et al.  Competitive collaborative learning , 2005, Journal of computer and system sciences (Print).

[17]  Alice Cheng,et al.  Sybilproof reputation mechanisms , 2005, P2PECON '05.

[18]  Ashish Goel,et al.  Incentive Based Ranking Mechanisms , 2006 .

[19]  Raph Levien,et al.  Attack-Resistant Trust Metrics , 2009, Computing with Social Trust.

[20]  Azadeh Iranmehr,et al.  Trust Management for Semantic Web , 2009, 2009 Second International Conference on Computer and Electrical Engineering.