Luca de Alfaro
Thomas A. Henzinger
Rupak Majumdar
2003
Discounting the Future in Systems Theory
International Colloquium on Automata, Languages and Programming, ICALP
1022–1037
10.1007/3-540-45061-0_79
Daniel Andersson
Peter Bro Miltersen
2009
The Complexity of Solving Stochastic Games on Graphs
International Symposium on Algorithms and Computation, ISAAC
112–121
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
1–7
10.1016/j.ipl.2007.08.035
Anne Condon
1992
The Complexity of Stochastic Games
Information and Computation
96
2
203–224
10.1016/0890-5401(92)90048-K
Anne Condon
1993
On Algorithms for Simple Stochastic Games
Advances in Computational Complexity Theory
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
13
American Mathematical Society
51–73
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
119–124
10.1016/S0020-0190(98)00150-1
Colin Stirling
1999
Bisimulation, Modal Logic and Model Checking Games
Logic Journal of the IGPL
7
1
103–124
10.1093/jigpal/7.1.103
Wolfgang Thomas
1997
Languages, Automata, and Logic
G. Rozenberg
A. Salomaa
Handbook of Formal Languages
7
3, Beyond Words
Springer
389–455
10.1.1.38.8643
Uri Zwick
Mike Paterson
1996
The complexity of mean payoff games on graphs
Theoretical Computer Science, TCS
158
343–359
10.1016/0304-3975(95)00188-3