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