8 citations · 22 across the 13 of their papers we have counts for
5 papers · 1 filter
Sound Value Iteration for Simple Stochastic Games
Muqsit Azeem, Jan Kretinsky, Maximilian Weininger
Algorithmic analysis of Markov decision processes (MDP) and stochastic games (SG) in practice relies on value-iteration (VI) algorithms. Since basic VI does not provide guarantees…
Sound Value Iteration for Simple Stochastic Games
Muqsit Azeem, Jan Kretinsky, Maximilian Weininger
Algorithmic analysis of Markov decision processes (MDP) and stochastic games (SG) in practice relies on value-iteration (VI) algorithms. Since the basic version of VI does not prov…
Comparison of Algorithms for Simple Stochastic Games
Jan Křetínský, Emanuel Ramneantu, Alexander Slivinskiy +1
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strat…
Stopping Criteria for Value and Strategy Iteration on Concurrent Stochastic Reachability Games
Julia Eisentraut, Jan Křetínský, Alexej Rotar
We consider concurrent stochastic games played on graphs with reachability and safety objectives. These games can be solved by value iteration as well as strategy iteration, each o…
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky +2
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a…