Abstract
We survey determinacy, definability, and
complexity issues of BanachMazur games on finite and
infinite graphs.
Infinite games where two players take turns to move a token
through a directed graph, thus tracing out an infinite path,
have numerous applications in different branches of mathematics
and computer science. In the usual format,
the possible moves of the players are given by
the edges of the graph; in each move
a player takes the token from its current position
along an edge to a next position. In BanachMazur games
the players instead select in each move a \emph{path}
of arbitrary finite length rather than just an edge.
In both cases the outcome of a play is an infinite
path. A winning condition is thus given by a set of
infinite paths which is often specified by a logical formula,
for instance from S1S, LTL, or firstorder logic.
BanachMazur games have a long tradition in descriptive
set theory and topology, and they have recently been shown to
have interesting applications also in computer science,
for instance for planning in nondeterministic domains,
for the study of fairness in concurrent systems, and
for the semantics of timed automata.
It turns out that BanachMazur games behave quite differently than
the usual graph games. Often they admit simpler winning strategies
and more efficient algorithmic solutions. For instance, BanachMazur
games with $\omega$regular winning conditions always have
positional winning strategies, and winning positions
for finite BanachMazur games with Muller winning condition
are computable in polynomial time.
BibTeX  Entry
@InProceedings{graedel:LIPIcs:2008:1768,
author = {Erich Graedel},
title = {{BanachMazur Games on Graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages = {364382},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783939897088},
ISSN = {18688969},
year = {2008},
volume = {2},
editor = {Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1768},
URN = {urn:nbn:de:0030drops17684},
doi = {10.4230/LIPIcs.FSTTCS.2008.1768},
annote = {Keywords: Games, strategies, determinacy, positional determinacy, definability, complexity}
}
Keywords: 

Games, strategies, determinacy, positional determinacy, definability, complexity 
Collection: 

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 
Issue Date: 

2008 
Date of publication: 

05.12.2008 