Dietmar Berwanger, Erich Grädel & Stephan Kreutzer (2003):
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games.
In: LPAR,
Lecture Notes in Computer Science 2850.
Springer,
pp. 229–243,
doi:10.1007/978-3-540-39813-4_16.
Mikolaj Bojanczyk & Thomas Colcombet (2006):
Bounds in w-Regularity.
In: LICS.
IEEE Computer Society,
pp. 285–296,
doi:10.1109/LICS.2006.17.
Erich Grädel (2008):
Banach-Mazur Games on Graphs.
In: FSTTCS,
LIPIcs 2.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 364–382,
doi:10.4230/LIPIcs.FSTTCS.2008.1768.
Erich Grädel & Simon Leßenich (2012):
Banach-Mazur Games with Simple Winning Strategies.
In: CSL,
LIPIcs 16.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 305–319,
doi:10.4230/LIPIcs.CSL.2012.305.
Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
LNCS 2500.
Springer.
Szczepan Hummel & MichałSkrzypczak (2012):
The topological complexity of MSO+U and related automata models.
Fund. Inform. 119(1),
pp. 87–111,
doi:10.3233/FI-2012-728.
Szczepan Hummel, MichałSkrzypczak & Szymon Torunczyk (2010):
On the Topological Complexity of MSO+U and Related Automata Models.
In: MFCS,
Lecture Notes in Computer Science 6281.
Springer,
pp. 429–440,
doi:10.1007/978-3-642-15155-2_38.
John C. Oxtoby (1957):
The Banach-Mazur Game and Banach Category Theorem.
Annals of Mathematical Studies 39,
pp. 159–163.
Contributions to the Theory of Games, volume 3.
Daniele Varacca & Hagen Völzer (2006):
Temporal Logics and Model Checking for Fairly Correct Systems..
In: Proc. 21st Ann. Symp. Logic in Computer Science (LICS'06).
IEEE Comp. Soc. Press,
pp. 389–398,
doi:10.1109/LICS.2006.49.
eptcs@eptcs.org