Algorithms for finding repeated game equilibria
From MaRDI portal
Publication:1367953
DOI10.1023/A:1008670607684zbMath0883.90140OpenAlexW1565818934MaRDI QIDQ1367953
Publication date: 5 October 1997
Published in: Computational Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008670607684
Computational methods for problems pertaining to game theory, economics, and finance (91-08) Multistage and repeated games (91A20)
Related Items (9)
Critical discount factor values in discounted supergames ⋮ A strategic dynamic programming method for studying short-memory equilibria of stochastic games with uncountable number of states ⋮ Elementary subpaths in discounted stochastic games ⋮ Conditional Markov equilibria in discounted dynamic games ⋮ Construction of subgame-perfect mixed-strategy equilibria in repeated games ⋮ Subgame perfect equilibria in discounted stochastic games ⋮ Set-valued games and mixed-strategy equilibria in discounted supergames ⋮ Computing equilibria in discounted dynamic games ⋮ Equilibrium paths in discounted supergames
Uses Software
This page was built for publication: Algorithms for finding repeated game equilibria
