Strategy Complexity of Reachability in Countable Stochastic 2-Player Games

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1

We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $\epsilon$-optimal (resp…