8 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.GT2020★ 8 cited
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…
cs.GT2020★ 8 cited
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…