Solving Simple Stochastic Games with Few Random Vertices

DOI10.2168/LMCS-5(2:9)2009MaRDI QIDQ3636809zbMATH OpenOpenAlexFDO

Authors Hugo Gimbert, Florian Horn

Publication date 30 June 2009

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-5(2:9)2009

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic games, stochastic differential games (91A15) Experimental studies (91A90)

Recommendations

• Solving Simple Stochastic Games
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve
• New results on simple stochastic games
• scientific article; zbMATH DE number 549853
• New algorithms for solving simple stochastic games

Cited in

(7)

• New algorithms for solving simple stochastic games
• A generic strategy improvement method for simple stochastic games
• Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
• Solving Simple Stochastic Games
• On strategy improvement algorithms for simple stochastic games
• scientific article; zbMATH DE number 1789317 (Why is no real title available?)
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve

This page was built for publication: Solving Simple Stochastic Games with Few Random Vertices

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