Abstract

 
 

References (12)



 


 



Cycles in Online Reputations


Florian Bersier


Oxford Internet Institute

July 16, 2012


Abstract:     
We build a model of reputation featuring a long-lived player (e.g. an online seller) and an infinite sequence of short-lived players (e.g. online buyers) which is consistent with three crucial idiosyncrasies of online reputation systems. First, players observe history of past actions upon condition that former short-lived players did not play the Nash convention and decided to trust the long-lived player in previous plays of the game. Second, a short-lived player's trusting action depends on the long-lived player's history of past actions and increases proportionally in the observation of high effort actions. Third, short-lived players may have partial knowledge about the entire history of the game to date given that the reputation system only makes publicly available a fixed and finite number of past actions. We show that this approach can explain the existence of cycles in reputations and we identify how the different parameters of the stage game can limit (or encourage, respectively) deviations from the Stackelberg convention.

Number of Pages in PDF File: 32

Keywords: reputation, rating systems, online reputations mechanisms

JEL Classification: D82, D84

working papers series


Download This Paper

Date posted: July 31, 2012 ; Last revised: August 7, 2012

Suggested Citation

Bersier, Florian, Cycles in Online Reputations (July 16, 2012). Available at SSRN: http://ssrn.com/abstract=2120454 or http://dx.doi.org/10.2139/ssrn.2120454

Contact Information

Florian Bersier (Contact Author)
Oxford Internet Institute ( email )
1 St. Giles
University of Oxford
Oxford OX1 3PG Oxfordshire, Oxfordshire OX1 3JS
United Kingdom
HOME PAGE: http://florianbersier.com
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 195
Downloads: 23
References:  12

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo4 in 0.391 seconds