Strategy complexity of reachability in countable stochastic 2-player games
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 and on whether one requires strategies that are...
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
Springer Nature
2024
|