Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
{{output}}
We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of ε -optimal (resp. optimal) strategies. These results depend on the size of the players' action sets a... ...
