Algorithms for stochastic games with perfect monitoring

DOI10.3982/ECTA14357MaRDI QIDQ4992142zbMATH OpenFDO

Authors Dilip Abreu, Benjamin Brooks, Yuliy Sannikov

Publication date 7 June 2021

Published in Econometrica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3982/ECTA14357

zbMATH Keywords

algorithmcomputationperfect monitoringstochastic game

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Algorithmic game theory and complexity (91A68)

Recommendations

• scientific article; zbMATH DE number 18885
• An algorithm for two-player repeated games with perfect monitoring
• Subgame perfect equilibria in discounted stochastic games
• Algorithms for stochastic games ? A survey
• Recursive methods in discounted stochastic games: an algorithm for 1 and a folk theorem

Cited in

(8)

• Determinacy of games with stochastic eventual perfect monitoring
• Empirical framework for two-player repeated games with random states
• Recursive methods in discounted stochastic games: an algorithm for 1 and a folk theorem
• Stochastic Algorithms, Symmetric Markov Perfect Equilibrium, and the 'curse' of Dimensionality
• An algorithm for two-player repeated games with perfect monitoring
• Exact algorithms for solving stochastic games
• The APS approach for undiscounted quitting games
• Zero-determinant strategies of three-player repeated games under noisy observation

This page was built for publication: Algorithms for stochastic games with perfect monitoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992142)