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. We establish some closure properties of such conditions, and discover some common reasons behind several known and new positional determinacy results, We exhibit several new classes of winning conditions having this property: the class of concave conditions (for finite arenas) and the classes of monotonic conditions and geometrical conditions (for all arenas). © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kopczyński, E. (2006). Half-positional determinacy of infinite games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 336–347). Springer Verlag. https://doi.org/10.1007/11787006_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
