Infinite games. (English) Zbl 1021.91502

Grädel, Erich (ed.) et al., Automata, logics, and infinite games. A guide to current research. Berlin: Springer. Lect. Notes Comput. Sci. 2500, 23-38, 365-376 (2002).
Summary: This chapter is meant as an introduction to infinite two-person games on directed graphs. We will define what they are, how they are played, what exactly a strategy is, what we mean when we say a game is won by a certain player, etc. We will introduce fundamental notions such as determinacy, forgetful strategies, memoryless strategies, and so on. And we will state fundamental results, which will be proved in later chapters of this volume.
For the entire collection see [Zbl 1011.00037].


91A05 2-person games
68Q45 Formal languages and automata
91A43 Games involving graphs
03E60 Determinacy principles
Full Text: DOI