Characterization and simplification of optimal strategies in positive stochastic games
From MaRDI portal
Publication:4555287
DOI10.1017/jpr.2018.47zbMath1417.91072MaRDI QIDQ4555287
William D. Sudderth, Arkadi Predtetchinski, Janos Flesch
Publication date: 19 November 2018
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/9b77a144-88f8-488f-b1f5-b870c6fffe9e
Markov chain; martingale; optimal stationary strategy; positive; two-person; zero-sum stochastic game; subgame-optimal strategy
60G42: Martingales with discrete parameter
91A05: 2-person games
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
91A15: Stochastic games, stochastic differential games
Related Items
Subgame maxmin strategies in zero-sum stochastic games with tolerance levels, Positive zero-sum stochastic games with countable state and action spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universally measurable strategies in zero-sum stochastic games
- Discounted, positive, and noncooperative stochastic games
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games
- On stochastic games. II
- Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic Games
- On Stochastic Games
- Simplifying Optimal Strategies in Stochastic Games
- Negative Dynamic Programming
- Discounted and positive stochastic games