Marcin Jurdzinski
Algorithms for solving parity games. In: Lectures in Game Theory for Computer Scientists, K. R. Apt and E. Graedel, editors, pages 74-98, Cambridge University Press, 2011.
Slides: http://www2.warwick.ac.uk/fac/sci/dcs/people/marcin_jurdzinski/files/Tsinghua2011.pdf
Peter Bro Miltersen
Peter Bro Miltersen: Discounted stochastic games poorly approximate undiscounted ones, Note, 2011.
http://www.cs.au.dk/~bromille/Papers/note2.pdf
Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen,Peter Bro Miltersen, Elias P. Tsigaridas: Exact algorithms for solving stochastic games, STOC’11.
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen and Peter Bro Miltersen: The complexity of solving reachability games using value and strategy iteration, CSR’11.
Slides: http://www.cs.au.dk/~bromille/Mini_3.ppt
Exercises: http://www.cs.au.dk/~bromille/stok3.pdf
Uri Zwick