Repeated games with incomplete information and discounting
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.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Susan Athey & Kyle Bagwell, 2008.
"Collusion With Persistent Cost Shocks,"
Econometric Society, vol. 76(3), pages 493-540, 05.
- Susan Athey & Kyle Bagwell, 2004. "Collusion with Persistent Cost Shocks," Levine's Bibliography 122247000000000334, UCLA Department of Economics.
- Susan Athey & Kyle Bagwell, 2007. "Collusion with Persistent Cost Shocks," Levine's Bibliography 321307000000000898, UCLA Department of Economics.
- Sergiu Hart, 1985. "Nonzero-Sum Two-Person Repeated Games with Incomplete Information," Mathematics of Operations Research, INFORMS, vol. 10(1), pages 117-153, February.
- HART, Sergiu, "undated". "Nonzerosum two-person repeated games with incomplete information," CORE Discussion Papers RP 636, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- repec:cor:louvrp:-636 is not listed on IDEAS Full references (including those not matched with items on IDEAS)