Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mazala, R. (2002). Infinite Games. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive