N. Berger, N. Kapur, L. J. Schulman & V. Vazirani (2008):
Solvency Games.
In: Proc. of FSTTCS'08,
doi:10.4230/LIPIcs.FSTTCS.2008.1741.
T. Brázdil, V. Brożek & K. Etessami (2010):
One-Counter Simple Stochastic Games.
In: Proc. of FSTTCS'10,
pp. 108–119,
doi:10.4230/LIPIcs.FSTTCS.2010.108.
T. Brázdil, V. Brożek, K. Etessami & A. Kučera (2011):
Approximating the Termination Value of One-Counter MDPs and Stochastic Games.
In: Proc. ICALP 2011.
Accepted, to appear..
T. Brázdil, V. Brożek, K. Etessami, A. Kučera & D. Wojtczak (2010):
One-Counter Markov Decision Processes.
In: ACM-SIAM SODA,
pp. 863–874.
Full tech report: CoRR, abs/0904.2511, 2009. http://arxiv.org/abs/0904.2511..
T. Brázdil, V. Brożek, V. Forejt & A. Kučera (2008):
Reachability in Recursive Markov Decision Processes.
Inform. and Comput. 206(5),
pp. 520–537,
doi:10.1016/j.ic.2007.09.002.
T. Brázdil, V. Brożek, A. Kučera & J. Obdrżálek (2009):
Qualitative Reachability in Stochastic BPA Games.
In: Proc. 26th STACS,
pp. 207–218,
doi:10.4230/LIPIcs.STACS.2009.1837.
T. Brázdil, V. Brożek, A. Kučera & J. Obdrżálek (2011):
Qualitative Reachability in Stochastic BPA Games.
Inform. and Comput.,
doi:10.1016/j.ic.2011.02.002.
Accepted, to appear soon. Preliminary version available at http://arxiv.org/abs/1003.0118..
A. Condon (1992):
The Complexity of Stochastic Games.
Inform. and Comput. 96,
pp. 203–224.
J. Esparza, A. Kučera & R. Mayr (2004):
Model-Checking Probabilistic Pushdown Automata.
In: Proc. of 19th LICS'04.
IEEE,
pp. 12–21.
K. Etessami & M. Yannakakis (2005):
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations.
In: Proc. of 22nd STACS'05.
Springer,
pp. 340–352.
H. Gimbert & F. Horn (2010):
Solving Simple Stochastic Tail Games.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA10),
pp. 847–862.
D. A. Martin (1998):
The Determinacy of Blackwell Games.
The Journal of Symbolic Logic 63(4),
pp. 1565–1581.
M. L. Puterman (1994):
Markov Decision Processes.
J. Wiley and Sons.
eptcs@eptcs.org