Half-Positional Determinacy of Infinite Games
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).
KeywordsGeometrical Condition Closure Property Countable Union Monotonic Condition Tree Automaton
Unable to display preview. Download preview PDF.
- [CDT02]Cachat, T., Duparc, J., Thomas, W.: Pushdown games with a Σ3 winning condition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 322–336 (2002)Google Scholar
- [EJ91]Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proceedings 32th Annual IEEE Symp. on Foundations of Comput, pp. 368–377. IEEE Computer Society Press, Sci (1991)Google Scholar
- [Kla92]Klarlund, N.: Progress measures, immediate determinacy, and a subset construction for tree automata. In: Proc. 7th IEEE Symp. on Logic in Computer Science (1992)Google Scholar
- [Kop06]E. Kopczyński, Half-positional determinacy of infinite games. Draft. http://www.mimuw.edu.pl/~erykk/papers/hpwc.ps
- [Mos91]Mostowski, A.W.: Games with forbidden positions. Technical Report 78, Uniwersytet Gdański, Instytut Matematyki (1991)Google Scholar