Value set iteration for two-person zero-sum Markov games
From MaRDI portal
Publication:503139
DOI10.1016/J.AUTOMATICA.2016.10.010zbMath1352.93042OpenAlexW2560789811MaRDI QIDQ503139
Publication date: 11 January 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2016.10.010
Cites Work
- Unnamed Item
- Unnamed Item
- Value set iteration for Markov decision processes
- Discounted Markov games: Generalized policy iteration method
- Discounted Markov games; successive approximation and stopping times
- The value iteration algorithm is not strongly polynomial for discounted dynamic programming
- Simulation-based algorithms for Markov decision processes
- Algorithms for discounted stochastic games
- Algorithms for stochastic games ? A survey
- The Gauss–Seidel Numerical Procedure for Markov Stochastic Games
- Stochastic Games
- A survey of computational complexity results in systems and control
This page was built for publication: Value set iteration for two-person zero-sum Markov games