R. Krzysztof, E. Apt, and . Grädel, Lectures in game theory for computer scientists, 2011.

T. Brihaye, G. Geeraerts, A. Haddad, B. Monmege, G. A. Pérez et al., Quantitative games under failures, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01273251

K. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative languages, ACM Trans. Comput. Log, vol.11, issue.4, 2010.

K. Chatterjee, T. A. Henzinger, and M. Jurdzinski, Mean-Payoff Parity Games, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.178-187, 2005.
DOI : 10.1109/LICS.2005.26
URL : https://hal.archives-ouvertes.fr/hal-00766251

J. Ehrenfeucht and . Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, vol.59, issue.2, pp.109-113, 1979.
DOI : 10.1007/BF01768705

S. Arthur, E. M. Goldstein, and . Reingold, The complexity of pursuit on a graph, Theor. Comput. Sci, vol.143, issue.1, pp.93-112, 1995.

F. G. Grüner, W. Radmacher, and . Thomas, Connectivity games over dynamic networks, Theoretical Computer Science, vol.493, pp.46-65, 2013.
DOI : 10.1016/j.tcs.2012.12.001

M. Jurdzi?ski, Deciding the winner in parity games is in UP ??? co-UP, Information Processing Letters, vol.68, issue.3, pp.119-124, 1998.
DOI : 10.1016/S0020-0190(98)00150-1

R. M. Karp, Reducibility among combinatorial problems, Proceedings of a Symposium on the Complexity of Computer Computations, pp.85-103, 1972.

D. Klein, F. G. Radmacher, and W. Thomas, Moving in a network under random failures: A complexity analysis, Science of Computer Programming, vol.77, issue.7-8, pp.940-954, 2012.
DOI : 10.1016/j.scico.2010.05.009

M. Kurzen, Complexity in interaction, 2011.

C. Löding and P. Rohde, Solving the Sabotage Game Is PSPACE-Hard, MFCS, pp.531-540, 2003.
DOI : 10.1007/978-3-540-45138-9_47

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

M. Sevenster, Branches of imperfect information: logic, games, and computation, 2006.

J. Larry, A. K. Stockmeyer, and . Chandra, Provably difficult combinatorial games, SIAM J. Comput, vol.8, issue.2, pp.151-174, 1979.

. 16-johan-van-benthem, An Essay on Sabotage and Obstruction, Mechanizing Mathematical Reasoning, volume 2605 of LNAI, pp.268-276, 2005.
DOI : 10.1007/978-3-540-32254-2_16

M. Yamashita and I. Suzuki, Characterizing geometric patterns formable by oblivious anonymous mobile robots, Theoretical Computer Science, vol.411, issue.26-28, pp.26-282433, 2010.
DOI : 10.1016/j.tcs.2010.01.037

U. Zwick and M. S. Paterson, The complexity of mean payoff games, Theor. Comput. Sci, vol.158, pp.343-359, 1996.
DOI : 10.1007/BFb0030814