Mikołaj Bojańczyk (2011):
Weak MSO with the Unbounding Quantifier.
Theory Comput. Syst. 48(3),
pp. 554–576,
doi:10.1007/s00224-010-9279-2.
J. Richard Büchi & Lawrence H. Landweber (1969):
Solving Sequential Conditions by Finite-State Strategies.
Transactions of the American Mathematical Society 138,
pp. 295–311,
doi:10.2307/1994916.
Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li & Frank Stephan (2017):
Deciding Parity Games in Quasipolynomial Time.
In: Hamed Hatami, Pierre McKenzie & Valerie King: STOC 2017.
ACM,
pp. 252–263,
doi:10.1145/3055399.3055409.
Krishnendu Chatterjee, Thomas A. Henzinger & Florian Horn (2011):
The Complexity of Request-Response Games.
In: Adrian Horia Dediu, Shunsuke Inenaga & Carlos Martín-Vide: LATA 2011,
LNCS 6638.
Springer,
pp. 227–237,
doi:10.1007/978-3-642-21254-3_17.
Thomas Colcombet, Nathanaël Fijalkow & Florian Horn (2014):
Playing Safe.
In: Venkatesh Raman & S. P. Suresh: FSTTCS 2014,
LIPIcs 29.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 379–390,
doi:10.4230/LIPIcs.FSTTCS.2014.379.
Stefan Dziembowski, Marcin Jurdziński & Igor Walukiewicz (1997):
How Much Memory is Needed to Win Infinite Games?.
In: LICS 1997.
IEEE Computer Society,
pp. 99–110,
doi:10.1109/LICS.1997.614939.
E. Allen Emerson & Charanjit S. Jutla (1991):
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract).
In: FOCS 1991.
IEEE Computer Society,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan & Dominik Wojtczak (2017):
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.
In: Hakan Erdogmus & Klaus Havelund: SPIN 2017.
ACM,
pp. 112–121,
doi:10.1145/3092282.3092286.
Nathanaël Fijalkow & Florian Horn (2013):
Les jeux d'accessibilité généralisée.
Technique et Science Informatiques 32(9-10),
pp. 931–949,
doi:10.3166/tsi.32.931-949.
See also arXiv:1010.2420.
Wladimir Fridman, Christof Löding & Martin Zimmermann (2011):
Degrees of Lookahead in Context-free Infinite Games.
In: Marc Bezem: CSL 2011,
LIPIcs 12.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 264–276,
doi:10.4230/LIPIcs.CSL.2011.264.
David Gale & Frank M. Stewart (1953):
Infinite Games with Perfect Information.
Annals of Mathematics 28,
pp. 245–266,
doi:10.1515/9781400881970-014.
Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
Michael Holtmann, Łukasz Kaiser & Wolfgang Thomas (2012):
Degrees of Lookahead in Regular Infinite Games.
LMCS 8(3),
doi:10.2168/LMCS-8(3:24)2012.
Florian Horn (2005):
Streett Games on Finite Graphs.
In: GDV 2005.
Available at https://www.irif.fr/~horn/publications.html.
Frederick A. Hosch & Lawrence H. Landweber (1972):
Finite Delay Solutions for Sequential Conditions.
In: ICALP 1972,
pp. 45–60.
Marcin Jurdzinski & Ranko Lazic (2017):
Succinct Progress Measures for Solving Parity Games.
In: LICS 2017.
IEEE Computer Society,
pp. 1–9,
doi:10.1109/LICS.2017.8005092.
Bakhadyr Khoussainov (2003):
Finite State Strategies in One Player McNaughton Games.
In: Cristian Calude, Michael J. Dinneen & Vincent Vajnovszki: DMTCS 2003, Dijon,
LNCS 2731.
Springer,
pp. 203–214,
doi:10.1007/3-540-45066-1_16.
Felix Klein & Martin Zimmermann (2015):
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead.
In: Stephan Kreutzer: CSL 2015,
LIPIcs 41.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 519–533,
doi:10.4230/LIPIcs.CSL.2015.519.
Felix Klein & Martin Zimmermann (2016):
How Much Lookahead is Needed to Win Infinite Games?.
LMCS 12(3),
doi:10.2168/LMCS-12(3:4)2016.
Felix Klein & Martin Zimmermann (2016):
Prompt Delay.
In: Akash Lal, S. Akshay, Saket Saurabh & Sandeep Sen: FSTTCS 2016,
LIPIcs 65.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 43:1–43:14,
doi:10.4230/LIPIcs.FSTTCS.2016.43.
Donald A. Martin (1975):
Borel determinacy.
Annals of Mathematics 102,
pp. 363–371,
doi:10.2307/1971035.
Robert McNaughton (1993):
Infinite Games Played on Finite Graphs.
Ann. Pure Appl. Logic 65(2),
pp. 149–184,
doi:10.1016/0168-0072(93)90036-D.
Andrzej Mostowski (1991):
Games with Forbidden Positions.
Technical Report 78.
University of Gdańsk.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of an Asynchronous Reactive Module.
In: Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca: ICALP 1989,
LNCS 372.
Springer,
pp. 652–671,
doi:10.1007/BFb0035790.
Michael O. Rabin (1969):
Decidability of Second-Order Theories And Automata on Infinite Trees.
Transactions of the American Mathematical Society 141(1-35),
pp. 4,
doi:10.2307/1995086.
Alexander Rabinovich (2009):
Synthesis of Finite-state and Definable Winning Strategies.
In: Ravi Kannan & K. Narayan Kumar: FSTTCS 2009,
LIPIcs 4.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 359–370,
doi:10.4230/LIPIcs.FSTTCS.2009.2332.
Stéphane Le Roux & Arno Pauly (2016):
Extending Finite Memory Determinacy to Multiplayer Games.
In: Alessio Lomuscio & Moshe Y. Vardi: SR 2016,
EPTCS 218,
pp. 27–40,
doi:10.4204/EPTCS.218.3.
Tobias Salzmann (2015):
How Much Memory is Needed to Win Regular Delay Games?.
Saarland University.
Wolfgang Thomas (1994):
Finite-State Strategies in Regular Infinite Games.
In: P. S. Thiagarajan: FSTTCS 1994,
LNCS 880.
Springer,
pp. 149–158,
doi:10.1007/3-540-58715-2_121.
Nico Wallmeier, Patrick Hütten & Wolfgang Thomas (2003):
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.
In: Oscar H. Ibarra & Zhe Dang: CIAA 2003,
LNCS 2759.
Springer,
pp. 11–22,
doi:10.1007/3-540-45089-0_3.
Igor Walukiewicz (2001):
Pushdown Processes: Games and Model-Checking.
Inf. and Comput. 164(2),
pp. 234–263,
doi:10.1006/inco.2000.2894.
Martin Zimmermann (2016):
Delay Games with WMSO+U Winning Conditions.
RAIRO - Theor. Inf. and Applic. 50(2),
pp. 145–165,
doi:10.1051/ita/2016018.
Martin Zimmermann (2017):
Finite-state Strategies in Delay Games (full version).
arXiv:1704.08887.
Available at https://arxiv.org/abs/1704.08887.
Martin Zimmermann (2017):
Games with Costs and Delays.
In: LICS 2017.
IEEE Computer Society,
pp. 1–12,
doi:10.1109/LICS.2017.8005125.