Trick or Treat: Putting Peer Prediction to the Test
View/ Open
32115688.pdf (586.8Kb)
Access Status
Full text of the requested work is not available in DASH at this time ("restricted access"). For more information on restricted deposits, see our FAQ.Published Version
https://doi.org/10.1145/2600057.2602865Metadata
Show full item recordCitation
Gao, Xi Alice, Andrew Mao, Yiling Chen, and Ryan Prescott Adams. 2014. "Trick or treat: putting peer prediction to the test." In Proceedings of the fifteenth ACM conference on Economics and computation, pp. 507-524. New York: ACM, 2014.Abstract
Collecting truthful subjective information from multiple individuals is an important problem in many social and online systems. While peer prediction mechanisms promise to elicit truthful information by rewarding participants with carefully constructed payments, they also admit uninformative equilibria where coordinating participants provide no useful information. To understand how participants behave towards such mechanisms in practice, we conduct the first controlled online experiment of a peer prediction mechanism, engaging the participants in a multiplayer, real-time and repeated game. Using a hidden Markov model to capture players' strategies from their actions, our results show that participants successfully coordinate on uninformative equilibria and the truthful equilibrium is not focal, even when some uninformative equilibria do not exist or are undesirable. In contrast, most players are consistently truthful in the absence of peer prediction, suggesting that these mechanisms may be harmful when truthful reporting has similar cost to strategic behavior.Citable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:28499006
Collections
- FAS Scholarly Articles [18292]
Contact administrator regarding this item (to report mistakes or request changes)