Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/93508 
Year of Publication: 
2013
Series/Report no.: 
MAGKS Joint Discussion Paper Series in Economics No. 29-2013
Publisher: 
Philipps-University Marburg, Faculty of Business Administration and Economics, Marburg
Abstract: 
In evolutionary models of indirect reciprocity, reputation mechanisms can stabilize cooperation even in severe cooperation problems like the prisoner’s dilemma. Under certain circumstances, conditionally cooperative strategies (“cooperate iff your partner has a good reputation”) cannot be invaded by any other strategy that conditions behavior only on own and partner reputation. Still, the evolutionary version of backward induction can lead to a breakdown of this kind of indirect reciprocity. Backward induction, however, requires strategies that count and then cease to cooperate in the last, last but one, last but two, … game they play. These strategies are unlikely to exist in natural settings. We present two new findings. (1) Surprisingly, the same kind of breakdown is also possible without counting. Opportunists using rare golden opportunities for defection can invade conditional cooperators. This can create further golden opportunities, inviting the next wave of opportunists, and so on, until cooperation breaks down completely. (2) Cooperation can be stabilized against these opportunists by letting an individual’s initial reputation be inherited from that individual’s parent. This ‘inclusive reputation’ mechanism can cope with any observably opportunistic strategy. Offspring of opportunists who successfully exploited a conditional cooperator cannot repeat their parents’ success because they inherit a bad reputation, which forewarns conditional cooperators in later generations.
Subjects: 
evolutionary game theory
repeated prisoner's dilemma
backward induction
conditional cooperation
opportunism
JEL: 
C73
D03
D64
Document Type: 
Working Paper

Files in This Item:
File
Size
480.88 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.