8 citations · 20 across the 3 of their papers we have counts for
3 papers
Optimistic and Topological Value Iteration for Simple Stochastic Games
Muqsit Azeem, Alexandros Evangelidis, Jan Křetínský +2
While value iteration (VI) is a standard solution approach to simple stochastic games (SSGs), it suffered from the lack of a stopping criterion. Recently, several solutions have ap…
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…
Comparison of Algorithms for Simple Stochastic Games (Full Version)
Jan Kretinsky, 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…