H. Björklund and S. Vorobyov, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Discrete Applied Mathematics, vol.155, issue.2, pp.210-229, 2007.
DOI : 10.1016/j.dam.2006.04.029

T. Brihaye, G. Geeraerts, L. Shankara-narayanan-krishna, B. Manasa, A. Monmege et al., Adding Negative Prices to Priced Timed Games, Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pp.560-575, 2014.
DOI : 10.1007/978-3-662-44584-6_38
URL : https://hal.archives-ouvertes.fr/hal-01273480

J. Brim, L. Chaloupka, R. Doyen, J. Gentilini, and . Raskin, Faster algorithms for mean-payoff games. Formal Methods for System Design, pp.97-118, 2011.

T. Chen, V. Forejt, M. Kwiatkowska, D. Parker, and A. Simaitis, Automatic verification of competitive stochastic systems, Formal Methods in System Design, vol.57, issue.3, pp.61-92, 2013.
DOI : 10.1007/s10703-013-0183-7

C. Comin and R. Rizzi, An improved pseudo-polynomial upper bound for the value problem and optimal strategy synthesis in mean payoff games, 2015.

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

E. Filiot, R. Gentilini, and J. Raskin, Quantitative Languages Defined by Functional Automata, Proceedings of the 23rd International Conference on Concurrency theory (CONCUR'12), pp.132-146, 2012.
DOI : 10.1007/978-3-642-32940-1_11
URL : https://hal.archives-ouvertes.fr/hal-01196264

M. Gawlitza and H. Seidl, Games through Nested Fixpoints, Proceedings of the 21st International Conference on Computer Aided Verification (CAV'09), pp.291-305, 2009.
DOI : 10.1007/978-3-642-02658-4_24

H. Gimbert and W. Zielonka, When Can You Play Positionally?, Proceedings of the 29th International Conference on Mathematical Foundations of Computer Science, pp.686-698, 2004.
DOI : 10.1007/978-3-540-28629-5_53

L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich et al., On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction, Theory of Computing Systems, pp.204-233, 2008.
DOI : 10.1007/s00224-007-9025-6

A. Donald and . Martin, Borel determinacy, Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.

L. Martin and . Puterman, Markov Decision Processes, 1994.

R. E. Strauch, Negative dynamic programming. The Annals of Mathematical Statistics, pp.871-890, 1966.

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

W. Thomas, On the synthesis of strategies in infinite games, Symposium on Theoretical Aspects of Computer Science (STACS'95), pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

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