On the positional determinacy of edge-labeled games

It is well known that games with the parity winning condition admit positional determinacy: the winner has always a positional (memoryless) strategy. This property continues to hold if edges rather than vertices are labeled. We show that in this latter case the converse is also true. That is, a winning condition over arbitrary set of colors admits positional determinacy in all games if and only if it can be reduced to a parity condition with some finite number of priorities.

[1]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[2]  Eryk Kopczynski,et al.  Half-Positional Determinacy of Infinite Games , 2006, ICALP.

[3]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[4]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[5]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[6]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[7]  Igor Walukiewicz,et al.  Positional Determinacy of Games with Infinitely Many Priorities , 2006, Log. Methods Comput. Sci..

[8]  Erich Grädel.  Positional Determinacy of Infinite Games , 2004, STACS.

[9]  J. Mycielski.  Games with perfect information , 1992 .

[10]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.