Recursive methods in discounted stochastic games: an algorithm for 1 and a folk theorem
From MaRDI portal
Publication:3165271
Recommendations
- A folk theorem for stochastic games with infrequent state changes
- Algorithms for stochastic games with perfect monitoring
- On the limit perfect public equilibrium payoff set in repeated and stochastic games
- A folk theorem for stochastic games with private almost-perfect monitoring
- Stochastic games with hidden states
Cited in
(34)- Fully absorbing dynamic compromise
- A limit theorem for Markov decision processes
- Asynchronous games with transfers: uniqueness and optimality
- A folk theorem for stochastic games with finite horizon
- Hidden stochastic games and limit equilibrium payoffs
- Discounted stochastic games with voluntary transfers
- Algorithms for stochastic games with perfect monitoring
- Protocol invariance and the timing of decisions in dynamic games
- Best-response dynamics in zero-sum stochastic games
- Folk theorems in repeated games with switching costs
- Delayed-response strategies in repeated games with observation lags
- A folk theorem for stochastic games with private almost-perfect monitoring
- Optimal decision rules in repeated games where players infer an opponent's mind via simplified belief calculation
- Cooperation dynamics in repeated games of adverse selection
- The modified stochastic game
- A folk theorem for the one-dimensional spatial bargaining model
- How fast do equilibrium payoff sets converge in repeated games?
- On the limit perfect public equilibrium payoff set in repeated and stochastic games
- Myopic perception in repeated games
- A folk theorem for stochastic games with infrequent state changes
- Failure of gradualism under imperfect monitoring
- Elementary subpaths in discounted stochastic games
- Persistence in a dynamic moral hazard game
- The folk theorem for repeated games with time-dependent discounting
- Optimizing over pure stationary equilibria in consensus stopping games
- The folk theorem for irreducible stochastic games with imperfect public monitoring
- Markov games with frequent actions and incomplete information -- the limit case
- Dynamic network formation with foresighted agents
- Comparison of information structures in stochastic games with imperfect public monitoring
- Relinquishing power, exploitation and political unemployment in democratic organizations
- Stochastic games
- On the strategic equivalence of linear dynamic and repeated games
- Construction of subgame-perfect mixed-strategy equilibria in repeated games
- Limit equilibrium payoffs in stochastic games
This page was built for publication: Recursive methods in discounted stochastic games: an algorithm for \(\delta \rightarrow 1\) and a folk theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165271)
