In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is particularly puzzling. Here we propose a novel approach to explain cooperation, assuming what Halpern and Pass (2013) call translucent players. Typically, players are assumed to be opaque, in the sense that a deviation by one player does not affect the strategies used by other players. But a player may believe that if he switches from one strategy to another, the fact that he chooses to switch may be visible to the other players. For example, if he chooses to defect in Prisoner's Dilemma, the other player may sense his guilt. We show that by assuming translucent players, we can recover many of the regularities observed in human behavior in well-studied games such as Prisoner’s Dilemma, Traveler’s Dilemma, Bertrand Competition, and the Public Goods game.
Additional Metadata
Keywords cooperation, game theory, translucency
THEME Null option (theme 11)
Publisher Lecture Notes in Computer Science
Persistent URL dx.doi.org/10.4204/EPTCS.215.9
Project Combining Machine Learning and Game-theoretic Approaches for Cluster Analysis
Conference Biannual Conference on Theoretical Aspects of Rationalism and Knowledge
Grant This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/612.001.352 - Combining Machine Learning and Game-theoretic Approaches for Cluster Analysis
Citation
Capraro, V, & Halpern, J.Y. (2016). Translucent players: explaining cooperative behavior in social dilemmas. In Proceedings of Biannual Conference on Theoretical Aspects of Rationalism and Knowledge 2015 (TARK). Lecture Notes in Computer Science. doi:10.4204/EPTCS.215.9