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...

全面介绍

书目详细资料
Main Authors: Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P
格式: Journal article
语言:English
出版: Springer Nature 2024

相似书籍