How much can we identify from repeated games?

Jose Miguel Abito

MPRA Paper from University Library of Munich, Germany

Abstract: I propose a strategy to identify structural parameters in infinitely repeated games without relying on equilibrium selection assumptions. Although Folk theorems tell us that almost any individually rational payoff can be an equilibrium payoff for sufficiently patient players, Folk theorems also provide tools to explicitly characterize this set of payoffs. I exploit the extreme points of this set to bound unobserved equilibrium continuation payoffs and then use these to generate informative bounds on structural parameters. I illustrate the identification strategy using (1) an infinitely repeated Prisoner's dilemma to get bounds on a utility parameter, and (2) an infinitely repeated quantity-setting game to get bounds on marginal cost and provide a robust test of firm conduct.

Keywords: Repeated games; identification; dynamic games; bounds (search for similar items in EconPapers)
JEL-codes: C1 C73 L4 (search for similar items in EconPapers)
Date: 2015-08-31
New Economics Papers: this item is included in nep-gth and nep-hpe
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/66378/1/Ident_repeated_games_folk.pdf original version (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:pra:mprapa:66378

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().