Efficient chip strategies in repeated games

Wojciech Olszewski () and Mikhail Safronov ()
Additional contact information
Wojciech Olszewski: Department of Economics, Northwestern University
Mikhail Safronov: Department of Economics, University of Cambridge

Theoretical Economics, 2018, vol. 13, issue 3

Abstract: We study a class of chip strategies in repeated games of incomplete information. This class generalizes the strategies studied by Möbius (2001) in the context of a favor-exchange model and the strategies studied in our companion paper Olszewski and Safronov (2017). In two-player games, if players have private values and their types evolve according to independent Markov chains, then under very mild conditions on the stage game, the efficient outcome can be approximated by chip-strategy equilibria when the discount factor tends to 1. We extend this result (assuming stronger conditions) to stage games with any number of players. Chip strategies can be viewed as a positive model of repeated interactions, and the insights from our analysis seem applicable in similar contexts, not covered by the present analysis.

Keywords: Repeated; games (search for similar items in EconPapers)
JEL-codes: C73 (search for similar items in EconPapers)
Date: 2018-10-04
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://econtheory.org/ojs/index.php/te/article/viewFile/20180951/21808/638 (application/pdf)

Related works:
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:the:publsh:2434

Access Statistics for this article

Theoretical Economics is currently edited by Simon Board, Todd D. Sarver, Juuso Toikka, Rakesh Vohra, Pierre-Olivier Weill

More articles in Theoretical Economics from Econometric Society
Bibliographic data for series maintained by Martin J. Osborne ().