Simple stochastic games, mean payoff games, parity games

Uri Zwick*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationComputer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings
Pages29
Number of pages1
DOIs
StatePublished - 2008
Event3rd International Computer Science Symposium in Russia, CSR 2008 - Moscow, Russian Federation
Duration: 7 Jun 200812 Jun 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5010 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Computer Science Symposium in Russia, CSR 2008
Country/TerritoryRussian Federation
CityMoscow
Period7/06/0812/06/08

Fingerprint

Dive into the research topics of 'Simple stochastic games, mean payoff games, parity games'. Together they form a unique fingerprint.

Cite this