D. Andersson and S. Vorobyov, Fast algorithms for monotonic discounted linear programs with two variables per inequality, Preprint NI06019-LAA, Isaac Netwon Institute for Mathematical Sciences, 2006.

P. Bouyer, U. Fahrenberg, K. Larsen, N. Markey, and J. Srba, Infinite Runs in Weighted Timed Automata with Energy Constraints, Lecture Notes in Computer Science, vol.5215, pp.33-47, 2008.
DOI : 10.1007/978-3-540-85778-5_4

URL : https://hal.archives-ouvertes.fr/hal-01194594

L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J. Raskin, Faster algorithms for mean-payoff games, Formal Methods in System Design, vol.158, issue.24, pp.97-118, 2011.
DOI : 10.1016/0304-3975(95)00188-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.589.6808

A. Chakrabarti, L. De-alfaro, T. Henzinger, and M. Stoelinga, Resource Interfaces, Embedded Software, pp.117-133, 2003.
DOI : 10.1007/978-3-540-45212-6_9

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

R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Computers in Physics, vol.3, issue.5, 1994.
DOI : 10.1063/1.4822863

V. Gurvich, A. Karzanov, and L. Khachiyan, Cyclic games and an algorithm to find minimax cycle means in directed graphs, USSR Computational Mathematics and Mathematical Physics, vol.28, issue.5, pp.85-91, 1988.
DOI : 10.1016/0041-5553(88)90012-2

M. Jurdzi´nskijurdzi´nski, 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

Y. Lifshits and D. Pavlov, Potential theory for mean payoff games, Journal of Mathematical Sciences, vol.158, issue.3, pp.4967-4974, 2007.
DOI : 10.1145/321992.321993

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.5895

J. Pawlewicz and M. , Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons, Algorithmica, vol.90, issue.1, pp.271-282, 2009.
DOI : 10.1007/978-3-540-24847-7_27

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3