Memoryless Strategies in Stochastic Reachability Games

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1

We study concurrent stochastic reachability games played on finite graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of reaching a set of…