Advanced Topics in Infinite Games

Zielonka Trees

Stefan Dziembowski, Marcin Jurdziński, Igor Walukiewicz. How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110 paper

Mean-payoff Games: Positional Determinacy

Andrzej Ehrenfeucht and Jan Mycielski. Positional Strategies for Mean Payoﬀ Games. International Journal of Game Theory, 8(2):109–113 (1979) paper (accessible from the university network)

Mean-payoff Games: Algorithms

Uri Zwick, Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theor. Comput. Sci. 158(1&2): 343-359 (1996) paper

Games of Ordinal Length

Julien Cristau, Florian Horn. Graph Games on Ordinals. FSTTCS 2008: 143-154 paper

Progress Measures

Marcin Jurdziński. Small Progress Measures for Solving Parity Games. STACS 2000: 290-301 paper

Permissive Strategies

Julien Bernet, David Janin, Igor Walukiewicz. Permissive Strategies: from Parity Games to Safety Games. ITA 36(3): 261-275 (2002) paper

Finitary Games

Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn. Finitary Winning in omega-regular Games. ACM Trans. Comput. Log. 11(1) (2009) paper

Energy Parity Games

Krishnendu Chatterjee, Laurent Doyen. Energy Parity Games. Theor. Comput. Sci. 458: 49-60 (2012) paper

Delay in Regular Games

Michael Holtmann, Łukasz Kaiser, Wolfgang Thomas. Degrees of Lookahead in Regular Infinite Games. Logical Methods in Computer Science 8(3) (2012) paper

Delay in Context-free Games

Wladimir Fridman, Christof Löding, Martin Zimmermann. Degrees of Lookahead in Context-free Infinite Games. CSL 2011: 264-276 paper

Games with Imperfect Information

Laurent Doyen and Jean-François Raskin. Games with Imperfect Information: Theory and Algorithms. Lectures in Game Theory for Computer Scientists. Cambridge University Press, pp. 185-212 (2011) paper

Concurrent Reachability Games

Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman. Concurrent Reachability Games. Theor. Comput. Sci. 386(3): 188-217 (2007) paper

Distributed Games

Swarup Mohalik, Igor Walukiewicz. Distributed Games. Proceedings of FSTTCS’03, LNCS 2914: 338-351 (2003) paper