Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/150222 
Erscheinungsjahr: 
2014
Quellenangabe: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 9 [Issue:] 2 [Publisher:] The Econometric Society [Place:] New Haven, CT [Year:] 2014 [Pages:] 313-338
Verlag: 
The Econometric Society, New Haven, CT
Zusammenfassung: 
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,≤ 3where A is the set of action profiles of the stage game.
Schlagwörter: 
Repeated games
perfect monitoring
computation
JEL: 
C63
C72
C73
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by-nc Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.