8 citations · 8 across the 1 of their papers we have counts for
1 paper
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…