Infinite Games Export

@incollection{citeulike:2946396, 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.}, author = {Mazala, Ren\'{e}}, citeulike-article-id = {2946396}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-36387-4_2}, citeulike-linkout-1 = {http://www.springerlink.com/content/ap2rm19e9cm2h5p7}, doi = {10.1007/3-540-36387-4_2}, journal = {Automata Logics, and Infinite Games}, keywords = {automata, copy, game-semantics}, pages = {197--204}, posted-at = {2008-07-01 03:08:33}, priority = {2}, title = {Infinite Games}, url = {http://dx.doi.org/10.1007/3-540-36387-4_2}, year = {2002} }

TY - CHAP ID - citeulike:2946396 L3 - citeulike-article-id:2946396 N2 - 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. JF - Automata Logics, and Infinite Games EP - 204 TI - Infinite Games SP - 197 KW - automata KW - copy KW - game-semantics AU - Mazala, René PY - 2002/// UR - http://dx.doi.org/10.1007/3-540-36387-4_2 ER -