A. Condon, The complexity of stochastic games, Information and Computation, vol.96, issue.2, pp.203-224, 1992.
DOI : 10.1016/0890-5401(92)90048-K

K. Chatterjee, Stochastic ?-regular games, 2007.
DOI : 10.1016/j.jcss.2011.05.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.1798

K. Etessami and M. Yannakakis, Recursive markov decision processes and recursive stochastic games, Proceedings of ICALP 2005, ser, pp.891-903, 2005.
DOI : 10.1007/11523468_72
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.5131

C. Baier, M. Größer, and N. Bertrand, Probabilistic ??-automata, Journal of the ACM, vol.59, issue.1, 2012.
DOI : 10.1145/2108242.2108243
URL : https://hal.archives-ouvertes.fr/hal-00743907

D. Beauquier and D. Niwi´nskiniwi´nski, Automata on Infinite Trees with Counting Constraints, Information and Computation, vol.120, issue.1, pp.117-125, 1995.
DOI : 10.1006/inco.1995.1104

V. Bárány, L. Kaiser, and A. Rabinovich, Expressing cardinality quantifiers in monadic second-order logic over trees, Fundamenta Informaticae, vol.100, pp.1-18, 2010.

H. Völzer and D. Varacca, Defining Fairness in Reactive and Concurrent Systems, Journal of the ACM, vol.59, issue.3, p.13, 2012.
DOI : 10.1145/2220357.2220360

E. Asarin, R. Chane-yack-fa, and D. Varacca, Fair Adversaries and Randomization in Two-Player Games, Proceedings of FoSSaCS 2010, ser. LNCS, pp.64-78, 2010.
DOI : 10.1007/978-3-642-12032-9_6
URL : https://hal.archives-ouvertes.fr/hal-00496917

A. Carayol, A. Haddad, and O. Serre, Counting branches in trees using games, Information and Computation, vol.252
DOI : 10.1016/j.ic.2016.11.005

D. A. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035

L. S. Shapley, Stochastic games, Proceedings of the National Academy of Science USA, pp.1095-1100, 1953.

P. S. Alexandrov, Sur la puissance des ensembles mesurables Comptes-Rendus de l'Académie des Sciences de Paris, pp.323-325, 1916.

A. Kechris, Classical Descriptive Set Theory, ser. Graduate Texts in Mathematics, 1995.

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, Algorithms for Omega-Regular Games with Imperfect Information, Logical Methods in Computer Science, vol.3, issue.3, 2007.
DOI : 10.1007/11874683_19

N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, Annals of Pure and Applied Logic, vol.69, issue.2-3, pp.243-268, 1994.
DOI : 10.1016/0168-0072(94)90086-8

A. Carayol, A. Haddad, and O. Serre, Randomisation in automata on infinite trees, ACM TOCL, vol.15, issue.3, p.24, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01260669

I. Walukiewicz, Pushdown Processes: Games and Model Checking, BRICS Report Series, vol.3, issue.54, pp.234-263, 2001.
DOI : 10.7146/brics.v3i54.20057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4162

M. Hague, A. S. Murawski, C. L. Ong, and O. Serre, Collapsible Pushdown Automata and Recursion Schemes, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.452-461, 2008.
DOI : 10.1109/LICS.2008.34
URL : https://hal.archives-ouvertes.fr/hal-00345945

J. Esparza, A. Ku?era, and R. Mayr, Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.117-126, 2005.
DOI : 10.1109/LICS.2005.39

A. Bouquet, O. Serre, and I. Walukiewicz, Pushdown Games with Unboundedness and Regular Conditions, Proceedings of FST&TCS 2003, ser. LNCS, pp.88-99, 2003.
DOI : 10.1007/978-3-540-24597-1_8
URL : https://hal.archives-ouvertes.fr/hal-00012141

H. Gimbert, Parity and Exploration Games on Infinite Graphs, Proceedings of CSL 2004 " , ser. LNCS, pp.56-70, 2004.
DOI : 10.1007/978-3-540-30124-0_8
URL : https://hal.archives-ouvertes.fr/hal-00160739

K. Etessami and M. Yannakakis, Recursive concurrent stochastic games, Logical Methods in Computer Science, vol.4, issue.4, 2008.
DOI : 10.1007/11787006_28
URL : http://arxiv.org/abs/0810.3581

B. Aminof, A. Legay, A. Murano, O. Serre, and M. Y. Vardi, Pushdown module checking with imperfect information, Information and Computation, vol.223, pp.1-17, 2013.
DOI : 10.1016/j.ic.2012.11.005
URL : https://hal.archives-ouvertes.fr/hal-01260664