An algorithm for two-player repeated games with perfect monitoring

DOI10.3982/TE1302MaRDI QIDQ4586097zbMATH OpenOpenAlexFDO

Authors Dilip Abreu, Yuliy Sannikov

Publication date 11 September 2018

Published in Theoretical Economics (Search for Journal in Brave)

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

zbMATH Keywords

computationperfect monitoringrepeated games

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• Algorithms for stochastic games with perfect monitoring
• Algorithms for finding repeated game equilibria
• Computing Supergame Equilibria
• Repeated games with public deterministic monitoring
• Infinitely repeated games with public monitoring and monetary transfers

Cited in

(13)

• On the equilibrium payoffs set of two player repeated games with imperfect monitoring
• Efficiency and observability with long-run and short-run players
• Algorithms for finding repeated game equilibria
• Discounted stochastic games with voluntary transfers
• Critical discount factor values in discounted supergames
• Construction of subgame-perfect mixed-strategy equilibria in repeated games
• Set-valued games and mixed-strategy equilibria in discounted supergames
• Repeated implementation: a practical characterization
• Equilibrium paths in discounted supergames
• On the limit perfect public equilibrium payoff set in repeated and stochastic games
• Empirical framework for two-player repeated games with random states
• Algorithms for stochastic games with perfect monitoring
• Zero-determinant strategies of three-player repeated games under noisy observation

This page was built for publication: An algorithm for two-player repeated games with perfect monitoring

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