Abstract
We study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a history-dependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or all finite arenas. Our main result is that this property is decidable in single exponential time for a given prefix independent w-regular winning condition. We also exhibit a big class of winning conditions (XPS) which has this property. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Kopczyński, E. (2007). Omega-regular half-positional winning conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4646 LNCS, pp. 41–53). Springer Verlag. https://doi.org/10.1007/978-3-540-74915-8_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
