TY - GEN
T1 - Simple stochastic games, mean payoff games, parity games
AU - Zwick, Uri
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=44649099615&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-79709-8_6
DO - 10.1007/978-3-540-79709-8_6
M3 - פרסום בספר כנס
AN - SCOPUS:44649099615
SN - 3540797084
SN - 9783540797081
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 29
BT - Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings
Y2 - 7 June 2008 through 12 June 2008
ER -