Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Never-ending Games

  News | Motivation | Topics | Time Schedule

Preliminary list of available topics:

The contents of the list might still change.
  • Small-progress measures for solving parity games

    Literature:
    • Marcin Jurdzinski: Small Progress Measures for Solving Parity Games
    • Grädel, Thomas, Wilke: Automata, Logics, and Infinite Games (Chapter 7)

  • Mean-payoff games: Relation to parity games; how to solve them using.

    Literature:
    • Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov: A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games

  • Rabin games and LTL synthesis

    Literature:
    • Nir Piterman, Amir Pnueli: Faster Solutions of Rabin and Streett Games
    • Lily

Assigned Topics

  • Solving games of imperfect information (Sebastian Vöst)
  • Literature:
    • Martin De Wulf, Lauren Doyen, Jean-Francois Raskin: A Lattice Theory for Solving Games of Imperfect Information
  • Muller games (Dieter Panin)
  • Literature:
    • John Fearnley, Martin Zimmermann: Playing Muller Games in a Hurry
  • Simple stochastic games and Markov decision processes: Applications and how to solve them. (Philipp Meyer)
  • Literature:
    • Anne Condon: On Algorithms for Simple Stochastic Games
    • Anne Condon: The Complexity of Stochastic Games
    • PRISM
  • Concurrent reachability games (Dennis Kraft)
  • Literature:
    • Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman: Concurrent Reachability Games.
  • Parity games on pushdown graphs (Georg Bachmeier)
  • Literature:
    • Thierry Cachat: Uniform Solution of Parity Games on Prefix-Recognizable Graphs
  • Reducing parity games to linear programming (Thomas Rebele)
  • Literature:
    • Sven Schewe: From Parity and Payoff Games to Linear Programming
  • Memoryless determinacy of parity games and Zielonka's algorithm (Katrin Kehrbusch).

    Literature:
    • Wieslaw Zielonka: Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
    • Grädel, Thomas, Wilke: Automata, Logics, and Infinite Games (Chapter 6)
    • Perrin and Pin: Infinite Words (Chapter IV.4)