, 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
, Multiplayer Cost Games with Simple Nash Equilibria, Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS'13), pp.59-73, 2013.
DOI : 10.1007/978-3-642-35722-0_5
, 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
, Simple priced timed games are not that simple, Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Schloss Dagstuhl?Leibniz-Zentrum für Informatik, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01452621
, To reach or not to reach? Efficient algorithms for total-payoff games, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), Schloss Dagstuhl? Leibniz-Zentrum für Informatik, LIPIcs, pp.297-310, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01273475
, Faster algorithms for mean-payoff games, Formal Methods in System Design, vol.158, issue.24, pp.97-118, 2011.
DOI : 10.1007/s10703-010-0105-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.589.6808
, 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
, An improved pseudo-polynomial upper bound for the value problem and optimal strategy synthesis in mean payoff games Positional strategies for mean payoff games, International Journal of Game Theory, vol.8, issue.2, pp.109-113, 1979.
, 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
, Games through Nested Fixpoints, Proceedings of the 21st International Conference on Computer Aided Verification, pp.291-305, 2009.
DOI : 10.1007/978-3-642-02658-4_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.8041
, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.4873
, On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction, Theory of Computing Systems, vol.158, issue.1???2, pp.204-233, 2008.
DOI : 10.1007/s00224-007-9025-6
, Nash Equilibria in Concurrent Priced Games, Proceedings of the 6th international conference on Language and Automata Theory and Applications (LATA'12, pp.363-376, 2012.
DOI : 10.1007/978-3-642-28332-1_31
, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035
, Markov Decision Processes Negative dynamic programming, The Annals of Mathematical Statistics, vol.37, pp.871-890, 1966.
, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
, 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
, The bad match; a total reward stochastic game, Operations-Research-Spektrum, vol.39, issue.2, pp.93-99, 1987.
DOI : 10.1073/pnas.39.10.1095
, The complexity of mean payoff games, Theoretical Computer Science, vol.158, pp.343-359, 1996.
DOI : 10.1007/BFb0030814