Positional determinacy of infinite games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 4-18

  Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INFINITE GAME; MULLER GAMES; PARITY GAMES; POSITIONAL WINNING STRATEGY;

SURVEYS;

EID: 21044460198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_2     Document Type: Article

References (22)

1. D. BERWANGER, E. GRÄDEL, AND S. KREUTZER, Once upon a time in the. west. Determinacy, complexity and definability of path games, in Proceedings of the 10th International Conference on Logic for Programming and Automated Reasoning, LPAR 2003, Almaty, Lecture Notes in Computer Science Nr. 2850, Springer-Verlag, 2003, pp. 226-240.
2. A. BOUQUET, O. SERRE, AND I. WALUKIEWICZ, Pushdown games with unboundedness and regular conditions. Submitted for publication.
3. 3 winning cndition, in Computer Science Logic, CSL 2002, Lecture Notes in Computer Science Nr. 2471, Springer-Verlag, 2002, pp. 322-336.
4. S. DZIEMBOWSKI, M. JURDZIŃSKl, AND I. WALUKIEWICZ, How much memory is needed to win infinite games?, in Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science (LICS 97), 1997, pp. 99-110.
5. A. EMERSON AND C. JUTLA, Tree automata, mu-calculus and determinacy, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 368-377.
6. E. GRÄDEL, W. THOMAS, AND T. WILKE, eds., Automata, Logics, and Infinite Games, Lecture Notes in Computer Science Nr. 2500, Springer, 2002.
7. E. GRÄDEL AND I. WALUKIEWICZ, Positional determinacy of games with infinitely many priorities. Submitted for publication.
8. Y. GUREVICH AND L. HARRINGTON, Trees, automata and games, in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC '82, 1982, pp. 60-65.
9. A. KANAMORI, The Higher Infinite, Springer, 1991.
10. A. KECHRIS, Classical Descriptive Set Theory, Springer, 1995.
11. N. KLARLUND, Progress measures, immediate determinacy, and a subset construction for tree au tomata, Annals of Pure and Applied Logic, 69 (1994), pp. 243-268.
12. S. LEONE, The Good, the Bad and the Ugly, with Glint Eastwood, Eli Wallach, Lee Van Cleef et al., 1966.
13. S. LEONE, Once Upon a Time in the West, with Charles Bronson, Claudia Cardinale, Henry Fonda et al., 1969.
14. D. MARTIN, Borel determinacy, Annals of Mathematics, 102 (1975), pp. 336-371.
15. R. MAULDIN, ed., The Scottish Book. Mathematics from the Scottish Café, Birkhäuser, 1981.
16. A. MOSTOWSKI, Games with forbidden positions, Tech. Rep. Tech. Report 78, University of Gdansk, 1991.
17. M. PISTORE AND M. VARDI, The planning spectrum -one, two, three, infinity, in Proc. 18th IEEE Symp. on Logic in Computer Science, 2003.
18. J. SWIFT, Gulliver's Travels, George Routledge and Sons, London, 1906. First published in 1726.
19. W. THOMAS, On the synthesis of strategies in infinite games, in Proceedings of STAGS 95, Lecture Notes in Computer Science Nr. 900, Springer-Verlag, 1995, pp. 1-13.
20. W. THOMAS, Languages, automata, and logic, in Handbook of Formal Languages Vol. 3, G. Rozenberg and A. Salomaa, eds., Springer, 1997, pp. 389-455.
21. E. ZERMELO, Über eine Anwendung der Mengenlehre auf die Theorie des Schachpiels, in Proc. 5th Internat. Congr. Mathematics, vol. 2, Cambridge, 1913, pp. 501-504.
22. W. ZIELONKA, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, 200 (1998), pp. 135-183.