Luca de Alfaro, Thomas A. Henzinger & Rupak Majumdar (2003):
Discounting the Future in Systems Theory.
In: International Colloquium on Automata, Languages and Programming, ICALP,
pp. 1022–1037,
doi:10.1007/3-540-45061-0_79.
Daniel Andersson & Peter Bro Miltersen (2009):
The Complexity of Solving Stochastic Games on Graphs.
In: International Symposium on Algorithms and Computation, ISAAC,
pp. 112–121,
doi:10.1007/978-3-642-10631-6_13.
Krishnendu Chatterjee & Thomas A. Henzinger (2008):
Reduction of stochastic parity to stochastic mean-payoff games.
Information Processing Letters, IPL 106(1),
pp. 1–7,
doi:10.1016/j.ipl.2007.08.035.
Anne Condon (1992):
The Complexity of Stochastic Games.
Information and Computation 96(2),
pp. 203–224,
doi:10.1016/0890-5401(92)90048-K.
Anne Condon (1993):
On Algorithms for Simple Stochastic Games.
In: Advances in Computational Complexity Theory,
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 13.
American Mathematical Society,
pp. 51–73,
doi:10.1.1.46.6099.
Marcin Jurdziński (1998):
Deciding the Winner in Parity Games is in UP co-UP.
Information Processing Letters, IPL 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
Colin Stirling (1999):
Bisimulation, Modal Logic and Model Checking Games.
Logic Journal of the IGPL 7(1),
pp. 103–124,
doi:10.1093/jigpal/7.1.103.
Wolfgang Thomas (1997):
Languages, Automata, and Logic.
In: G. Rozenberg & A. Salomaa: Handbook of Formal Languages, chapter 7 3, Beyond Words.
Springer,
pp. 389–455,
doi:10.1.1.38.8643.
Uri Zwick & Mike Paterson (1996):
The complexity of mean payoff games on graphs.
Theoretical Computer Science, TCS 158,
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.
eptcs@eptcs.org