A generic strategy improvement method for simple stochastic games

DOI10.4230/LIPICS.MFCS.2021.12MaRDI QIDQ6168423zbMATH OpenFDO

Authors David Auger, Yann Strozecki

Publication date 8 August 2023

Full work available at URL https://arxiv.org/abs/2102.04922

zbMATH Keywords

f-strategymeta algorithmparametrized complexitysimple stochastic gamesstoppingstrategy improvement

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On strategy improvement algorithms for simple stochastic games
• On strategy improvement algorithms for simple stochastic games
• Solving Simple Stochastic Games
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve
• Solving Simple Stochastic Games with Few Random Vertices

Cited in

(6)

• Strategy optimization for static games based on STP method
• Augmented probability simulation methods for sequential games
• On an algorithm for successive improvement of a strategy
• Simplifying Optimal Strategies in Stochastic Games
• Fixpoint Theory -- Upside Down
• Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games

This page was built for publication: A generic strategy improvement method for simple stochastic games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168423)