Simple Stochastic Games, Mean Payoff Games, Parity Games

  • Uri Zwick
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)


Simple Stochastic Games (SSGs), Mean Payoff Games (MPGs), and Parity Games (PGs) are three closely related families of infinite-duration games played on finite graphs. The best known algorithms for the solution of these games run in subexponential time and it is a major open problem whether they can be solved in polynomial time. In the talk, I plan to define these games, describe what is known about them and present many intriguing open problems.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Uri Zwick
    • 1
  1. 1.Tel Aviv UniversityIsrael

Personalised recommendations