Discounted Markov games: Generalized policy iteration method
From MaRDI portal
Cites work
- A modified dynamic programming method for Markovian decision problems
- A set of successive approximation methods for discounted Markovian decision problems
- Algorithms for Stochastic Games with Geometrical Interpretation
- Discounted Markov games; successive approximation and stopping times
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3628710 (Why is no real title available?)
- On Markov games
- On Nonterminating Stochastic Games
- On some stocxastic tactical antisubmarine games
- Some Bounds for Discounted Sequential Decision Processes
- Stochastic Games
Cited in
(12)- A short certificate of the number of universal optimal strategies for stopping simple stochastic games
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- Piecewise constant policy approximations to Hamilton-Jacobi-Bellman equations
- scientific article; zbMATH DE number 3963605 (Why is no real title available?)
- (Approximate) iterated successive approximations algorithm for sequential decision processes
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
- Numerical methods for dynamic Bertrand oligopoly and American options under regime switching
- Policy iteration algorithms for zero-sum stochastic differential games with long-run average payoff criteria
- Value set iteration for two-person zero-sum Markov games
- On the complexity of computational problems associated with simple stochastic games
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
- Dynamic operational planning in warfare: a stochastic game approach to military campaigns
This page was built for publication: Discounted Markov games: Generalized policy iteration method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1236071)