Finitely repeated games with social preferences
Jörg Oechssler
No 515, Working Papers from University of Heidelberg, Department of Economics
Abstract:
A well—known result from the theory of finitely repeated games states that if the stage game has a unique equilibrium, then there is a unique subgame perfect equilibrium in the finitely repeated game in which the equilibrium of the stage game is being played in every period. Here I show that this result does in general not hold anymore if players have social preferences of the form frequently assumed in the recent literature, for example in the inequity aversion models of Fehr and Schmidt (1999) or Bolton and Ockenfels (2000). In fact, repeating the unique stage game equilibrium may not be a subgame perfect equilibrium at all.
Keywords: social preferences; finitely repeated games; inequity aversion; ERC (search for similar items in EconPapers)
Date: 2011-09-22
New Economics Papers: this item is included in nep-evo, nep-gth, nep-hpe, nep-mic and nep-upt
Note: This paper is part of http://archiv.ub.uni-heidelberg.de/volltextserver/view/schriftenreihen/sr-3.html
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
https://nbn-resolving.de/urn:nbn:de:bsz:16-opus-125120 Frontdoor page on HeiDOK (text/html)
https://archiv.ub.uni-heidelberg.de/volltextserver ... ssler_2011_dp515.pdf (application/pdf)
Related works:
Journal Article: Finitely repeated games with social preferences (2013) 
Working Paper: Finitely repeated games with social preferences (2011) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:awi:wpaper:0515
Access Statistics for this paper
More papers in Working Papers from University of Heidelberg, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Gabi Rauscher ( this e-mail address is bad, please contact ).