Positional Determinacy of Infinite Games

We survey results on determinacy of games and on the existence of positional winning strategies for parity games and Rabin games. We will then discuss some new developments concerning positional determinacy for path games and for Muller games with infinitely many priorities.

[1]  A. Kanamori.  The Higher Infinite , 1994 .

[2]  R. Daniel Mauldin,et al.  The Scottish book : mathematics from the Scottish Café , 1981 .

[3]  Nils Klarlund,et al.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

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

[5]  Marco Pistore,et al.  The planning spectrum - one, two, three, infinity , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[6]  Wolfgang Thomas,et al.  Solving Pushdown Games with a Sigma3 Winning Condition , 2002, CSL.

[7]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[8]  Igor Walukiewicz,et al.  How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[9]  P. Manow.  ‚The Good, the Bad, and the Ugly‘ , 2002 .

[10]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[11]  Jim Alves-Foss,et al.  Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .

[12]  Stephan Kreutzer,et al.  Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games , 2003, LPAR.

[13]  A. Kechris.  Classical descriptive set theory , 1987 .

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

[15]  Igor Walukiewicz,et al.  Pushdown Games with Unboundedness and Regular Conditions , 2003, FSTTCS.

[16]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.