52 citations · 146 across the 41 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2022
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 -optimal (resp…
cs.GT2017
On Strong Determinacy of Countable Stochastic Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.…