Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/150234 
Authors: 
Year of Publication: 
2014
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 9 [Issue:] 3 [Publisher:] The Econometric Society [Place:] New Haven, CT [Year:] 2014 [Pages:] 651-694
Publisher: 
The Econometric Society, New Haven, CT
Abstract: 
Abstract. We analyze discounted repeated games with incomplete information, such that the players' payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of Hörner and Lovo (2009). This includes generic games with one-sided incomplete information and a large and important class of games with multi-sided incomplete information. When players become sufficiently patient, all Bayesian Nash equilibrium payoffs can be approximated by payoffs in sequential equilibria in which information is revealed finitely many times. The set of equilibrium payoffs is typically larger than the set of equilibrium payoffs in repeated games without discounting, and larger than the set of payoffs obtained in belief-free equilibria. The results are illustrated in bargaining and oligopoly examples.
Subjects: 
Repeated games
incomplete information
reputation
JEL: 
C73
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article

Files in This Item:
File
Size





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