The Social Cost of Cheap Pseudonyms

We consider the problems of societal norms for cooperation and reputation when it is possible to obtain cheap pseudonyms, something that is becoming quite common in a wide variety of interactions on the Internet. This introduces opportunities to misbehave without paying reputational consequences. A large degree of cooperation can still emerge, through a convention in which newcomers "pay their dues" by accepting poor treatment from players who have established positive reputations. One might hope for an open society where newcomers are treated well, but there is an inherent social cost in making the spread of reputations optional. We prove that no equilibrium can sustain significantly more cooperation than the dues-paying equilibrium in a repeated random matching game with a large number of players in which players have finite lives and the ability to change their identities, and there is a small but nonvanishing probability of mistakes. Although one could remove the inefficiency of mistreating newcomers by disallowing anonymity, this is not practical or desirable in a wide variety of transactions. We discuss the use of entry fees, which permits newcomers to be trusted but excludes some players with low payoffs, thus introducing a different inefficiency. We also discuss the use of free but unreplaceable pseudonyms, and describe a mechanism that implements them using standard encryption techniques, which could be practically implemented in electronic transactions. Copyright (c) 2001 Massachusetts Institute of Technology.

[1]  J. Hooper,et al.  Simultaneous Equations and Canonical Correlation Theory , 1959 .

[2]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3]  Oliver E. Williamson,et al.  Franchise Bidding for Natural Monopolies -- in General and with Respect to CATV , 1976 .

[4]  B. Klein,et al.  The Role of Market Forces in Assuring Contractual Performance , 1981, Journal of Political Economy.

[5]  David M. Kreps,et al.  Rational cooperation in the finitely repeated prisoners' dilemma , 1982 .

[6]  C. Shapiro Premiums for High Quality Products as Returns to Reputations , 1983 .

[7]  Costas Azariadis,et al.  Implicit Contracts and Fixed Price Equilibria , 1983 .

[8]  R. Porter,et al.  NONCOOPERATIVE COLLUSION UNDER IMPERFECT PRICE INFORMATION , 1984 .

[9]  Paul R. Milgrom,et al.  The role of institutions in the revival of trade: the law merchant , 1990 .

[10]  E. Stacchetti,et al.  Towards a Theory of Discounted Repeated Games with Imperfect Monitoring , 1990 .

[11]  H. Moulin,et al.  Serial Cost Sharing , 1992 .

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

[13]  M. Nowak,et al.  A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game , 1993, Nature.

[14]  Glenn Ellison Cooperation in the Prisoner's Dilemma with Anonymous Random Matching , 1994 .

[15]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.

[16]  Debraj Ray,et al.  Cooperation in Community Interaction Without Information Flows , 1996 .

[17]  Sharing the cost of multicast trees , 1995 .

[18]  Rachel E. Kranton,et al.  The Formation of Cooperative Relationships , 1996 .

[19]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[20]  Eric J. Friedman,et al.  Learning and Implementation on the Internet , 1997 .

[21]  Joel Watson,et al.  Starting Small and Renegotiation , 1997 .

[22]  W. MacLeod,et al.  Gift Giving and the Evolution of Cooperation , 1997 .

[23]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1997, TNET.

[24]  Yannis Bakos,et al.  Bundling Information Goods: Pricing, Profits and Efficiency , 1998 .

[25]  D. Fudenberg,et al.  When Are Nonanonymous Players Negligible , 1998 .

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

[27]  Paul F. Syverson,et al.  Onion routing , 1999, CACM.

[28]  Paul Syverson,et al.  Onion Routing for Anonymous and Private Internet Connections , 1999 .

[29]  Rob Kling,et al.  Anonymous Communication Policies for the Internet: Results and Recommendations of the AAAS Conference , 1999, Inf. Soc..

[30]  P. Resnick,et al.  The Market for Evaluations , 1999 .

[31]  P. Kollock The Production of Trust in Online Markets , 1999 .

[32]  Michael K. Reiter,et al.  Anonymous Web transactions with Crowds , 1999, CACM.

[33]  Rob Kling,et al.  Assessing Anonymous Communication on the Internet: Policy Deliberations , 1999, Inf. Soc..

[34]  Helen Nissenbaum,et al.  The Meaning of Anonymity in an Information Age , 1999, Inf. Soc..

[35]  Gary T. Marx,et al.  What's in a Name? Some Reflections on the Sociology of Anonymity , 1999, Inf. Soc..

[36]  Ali Hortaçsu,et al.  Winner's Curse, Reserve Prices and Endogenous Entry: Empirical Insights from Ebay Auctions , 2003 .

[37]  David H. Reiley,et al.  Pennies from Ebay: The Determinants of Price in Online Auctions , 2000 .

[38]  Gary E. Bolton,et al.  Bridging the Trust Gap in Electronic Markets , 2002 .

[39]  Steven Tadelis,et al.  The Market for Reputations as an Incentive Mechanism , 2001, Journal of Political Economy.

[40]  Paul Resnick,et al.  The value of reputation on eBay: A controlled experiment , 2002 .

[41]  Axel Ockenfels,et al.  Reputationsmechanismen auf Internet-Marktplattformen - Theorie und Empirie - , 2002 .

[42]  H. Varian BUYING, SHARING AND RENTING INFORMATION GOODS* , 2003 .