Artikel

An algorithm for two-player repeated games with perfect monitoring

Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing implementations of the algorithm from Abreu, Pearce and Stacchetti (1990). These efficiency gains arise from a better understanding of the manner in which extreme points of the equilibrium payoff set are generated. An important theoretical implication of our algorithm is that the set of extreme points E of V* is finite. Indeed, |E| ≤ 3|A|, where A is the set of action profiles of the stage game.

Sprache
Englisch

Erschienen in
Journal: Theoretical Economics ; ISSN: 1555-7561 ; Volume: 9 ; Year: 2014 ; Issue: 2 ; Pages: 313-338 ; New Haven, CT: The Econometric Society

Klassifikation
Wirtschaft
Computational Techniques; Simulation Modeling
Noncooperative Games
Stochastic and Dynamic Games; Evolutionary Games; Repeated Games
Thema
Repeated games
perfect monitoring
computation

Ereignis
Geistige Schöpfung
(wer)
Abreu, Dilip
Sannikov, Yuliy
Ereignis
Veröffentlichung
(wer)
The Econometric Society
(wo)
New Haven, CT
(wann)
2014

DOI
doi:10.3982/TE1302
Handle
Letzte Aktualisierung
10.03.2025, 11:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Artikel

Beteiligte

  • Abreu, Dilip
  • Sannikov, Yuliy
  • The Econometric Society

Entstanden

  • 2014

Ähnliche Objekte (12)