Algorithms for discounted stochastic games
From MaRDI portal
Cites work
- Algorithms for Stochastic Games with Geometrical Interpretation
- Discrete Dynamic Programming
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- Noncooperative Stochastic Games
- On Nonterminating Stochastic Games
- On stochastic games
- 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
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- scientific article; zbMATH DE number 3963605 (Why is no real title available?)
- Stochastic game models of brand switching
- New algorithms for solving zero-sum stochastic games
- Value set iteration for two-person zero-sum Markov games
- Towards solving 2-TBSG efficiently
- A formula for the value of a stochastic game
- On the complexity of computational problems associated with simple stochastic games
- Smoothed analysis of deterministic discounted and Mean-payoff games
This page was built for publication: Algorithms for discounted stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555468)