Infinite Games

  • René Mazala
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)


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.


Winning Strategy Acceptance Condition Previous Chapter Trapping Strategy Winning Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • René Mazala
    • 1
  1. 1.Institut für InformatikMartin-Luther-Universität Halle-WittenbergGermany

Personalised recommendations