Constructing strategies in the indefinitely repeated prisoner’s dilemma game
AffiliationUniv Arizona, Eller Coll Managment
KeywordsIndefinitely repeated games
MetadataShow full item record
PublisherELSEVIER SCIENCE BV
CitationRomero, J., & Rosokha, Y. (2018). Constructing strategies in the indefinitely repeated prisoner’s dilemma game. European Economic Review, 104, 185-219. https://doi.org/10.1016/j.euroecorev.2018.02.008
JournalEUROPEAN ECONOMIC REVIEW
Rights© 2018 Elsevier B.V. All rights reserved.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractWe propose a new approach for running lab experiments on indefinitely repeated games with high continuation probability. This approach has two main advantages. First, it allows us to run multiple long repeated games per session. Second, it allows us to incorporate the strategy method with minimal restrictions on the set of pure strategies that can be implemented. This gives us insight into what happens in long repeated games and into the types of strategies that subjects construct. We report results obtained from the indefinitely repeated prisoner's dilemma with a continuation probability of delta = .95. We find that during such long repeated prisoner's dilemma games, cooperation drops from the first period of a supergame to the last period of a supergame. When analyzing strategies, we find that subjects rely on strategies similar to those found in the literature on shorter repeated games-specifically Tit-For-Tat, Grim Trigger, and Always Defect. However, we also identify features of strategies that depend on more than just the previous period that are responsible for the drop in cooperation within supergames, but that may be overlooked when using the common strategy frequency estimation approach. (C) 2018 Elsevier B.V. All rights reserved.
Note24 month embargo; published online: 17 March 2018.
VersionFinal accepted manuscript