Solving Simple Stochastic Games with Few Coin Toss Positions
From MaRDI portal
Publication:2912881
DOI10.1007/978-3-642-33090-2_55zbMath1365.68283arXiv1112.5255OpenAlexW1510370302MaRDI QIDQ2912881
Rasmus Ibsen-Jensen, Peter Bro Miltersen
Publication date: 25 September 2012
Published in: Algorithms – ESA 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.5255
Analysis of algorithms and problem complexity (68Q25) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)
Related Items (8)
Strategy improvement for concurrent reachability and turn-based stochastic safety games ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ Unnamed Item ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A non-iterative algorithm for generalized pig games ⋮ Comparison of algorithms for simple stochastic games
This page was built for publication: Solving Simple Stochastic Games with Few Coin Toss Positions