B. Aminof, O. Kupferman, and R. Lampert, Reasoning about online algorithms with weighted automata, ACM Transactions on Algorithms, 2010.

C. Baier and J. Katoen, Principles of model checking, 2008.

D. Berwanger, Admissibility in Infinite Games, Proc. of STACS, pp.188-199, 2007.
DOI : 10.1007/978-3-540-70918-3_17

R. Bloem, R. Ehlers, S. Jacobs, and R. Könighofer, How to Handle Assumptions in Synthesis, Proc. of SYNT, pp.34-50, 2014.
DOI : 10.4204/EPTCS.157.7

A. Brandenburger, A. Friedenberg, and H. J. Keisler, Admissibility in games, Econometrica, vol.76, issue.2, 2008.

T. Brázdil, K. Chatterjee, V. Forejt, and A. Kucera, Trading performance for stability in Markov decision processes, Proc. of LICS, pp.331-340, 2013.

R. Brenguier, J. Raskin, and O. Sankur, Assume-admissible synthesis, Proc. of CONCUR, LIPIcs 42, pp.100-113, 2015.
DOI : 10.1111/j.1468-0262.2008.00835.x
URL : https://hal.archives-ouvertes.fr/hal-01245193

R. Brenguier, J. Raskin, and M. Sassolas, The complexity of admissibility in Omega-regular games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-2310, 2014.
DOI : 10.1145/2603088.2603143
URL : https://hal.archives-ouvertes.fr/hal-01161868

T. Brihaye, V. Bruyère, N. Meunier, and J. Raskin, Weak subgame perfect equilibria and their application to quantitative reachability, Proc. of CSL, LIPIcs 41, pp.504-518, 2015.

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

V. Bruyère, E. Filiot, M. Randour, and J. Raskin, Expectations or Guarantees? I Want It All! A crossroad between games and MDPs, Proc. of SR, EPTCS 146, pp.1-8, 2014.
DOI : 10.4204/EPTCS.146.1

V. Bruyère, E. Filiot, M. Randour, and J. Raskin, Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games, Proc. of STACS, LIPIcs 25, pp.199-213, 2014.
DOI : 10.1016/j.ic.2016.10.011

V. Bruyère, N. Meunier, and J. Raskin, Secure equilibria in weighted games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-2626, 2014.
DOI : 10.1145/2603088.2603109

K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, Doomsday equilibria for omega-regular games, Proc. of VMCAI, pp.78-97, 2014.

K. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative languages, ACM Transactions on Computational Logic, vol.11, issue.4, 2010.

K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, Looking at mean-payoff and total-payoff through windows, Information and Computation, vol.242, pp.25-52, 2015.
DOI : 10.1016/j.ic.2015.03.010

K. Chatterjee and T. A. Henzinger, Assume-Guarantee Synthesis, Proc. of TACAS, pp.261-275, 2007.
DOI : 10.1007/978-3-540-71209-1_21

K. Chatterjee, T. A. Henzinger, and M. Jurdzi´nskijurdzi´nski, Games with secure equilibria, Theoretical Computer Science, vol.365, issue.1-2, pp.67-82, 2006.
DOI : 10.1016/j.tcs.2006.07.032
URL : http://doi.org/10.1016/j.tcs.2006.07.032

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, Proc. of Logics of Programs, pp.52-71, 1981.

L. Clemente and J. Raskin, Multidimensional beyond worst-case and almostsure problems for mean-payoff objectives, Proc. of LICS, pp.257-268, 2015.

T. Colcombet, Forms of determinism for automata, Proc. of STACS, LIPIcs 14, pp.1-23, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678155

W. Damm and B. Finkbeiner, Does It Pay to Extend the Perimeter of a World Model?, Proc. of FM, pp.12-26, 2011.
DOI : 10.2307/2232669

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

M. Faella, Admissible Strategies in Infinite Games over Graphs, Proc. of MFCS, pp.307-318, 2009.
DOI : 10.1016/S0304-3975(98)00009-7

J. Filar and K. Vrieze, Competitive Markov decision processes, 1997.
DOI : 10.1007/978-1-4612-4054-9

J. A. Filar, D. Krass, and K. W. Ross, Percentile performance criteria for limiting average Markov decision processes, IEEE Transactions on Automatic Control, vol.40, issue.1, pp.2-10, 1995.
DOI : 10.1109/9.362904

E. Filiot, T. L. Gall, and J. Raskin, Iterated Regret Minimization in Game Graphs, Proc. of MFCS, pp.342-354, 2010.
DOI : 10.1007/978-3-642-15155-2_31
URL : https://hal.archives-ouvertes.fr/inria-00492237

D. Fisman, O. Kupferman, and Y. Lustig, Rational Synthesis, Proc. of TACAS, pp.190-204, 2010.
DOI : 10.1007/978-3-642-12002-2_16

J. Y. Halpern and R. Pass, Iterated regret minimization: A new solution concept, Games and Economic Behavior, vol.74, issue.1, pp.184-207, 2012.
DOI : 10.1016/j.geb.2011.05.012

T. A. Henzinger and N. Piterman, Solving Games Without Determinization, Proc. of CSL, pp.395-410, 2006.
DOI : 10.1007/11874683_26

P. Hunter, G. A. Pérez, and J. Raskin, Reactive synthesis without regret, Proc. of CONCUR, LIPIcs 42, pp.114-127, 2015.
DOI : 10.2168/LMCS-3(3:5)2007

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

O. Kupferman, G. Perelli, and M. Y. Vardi, Synthesis with rational environments, Proc. of EUMAS, pp.219-235, 2014.

S. Mannor and J. Tsitsiklis, Mean-variance optimization in Markov decision processes, Proc. of ICML, pp.177-184, 2011.

F. Mogavero, A. Murano, and M. Y. Vardi, Reasoning about strategies, Proc. of FSTTCS, LIPIcs 8, pp.133-144, 2010.

J. Nash, Equilibrium points in n-person games, pp.48-49, 1950.

M. Puterman, Markov decision processes: discrete stochastic dynamic programming, 1994.
DOI : 10.1002/9780470316887

J. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Proc. of International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

M. Randour, J. Raskin, and O. Sankur, Percentile queries in multi-dimensional Markov decision processes, Proc. of CAV, pp.123-139, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01245196

M. Randour, J. Raskin, and O. Sankur, Variations on the Stochastic Shortest Path Problem, Proc. of VMCAI, pp.1-18, 2015.
DOI : 10.1007/978-3-662-46081-8_1
URL : https://hal.archives-ouvertes.fr/hal-01248766

M. Ummels, Rational Behaviour and Strategy Construction in Infinite Multiplayer Games, Proc. of FSTTCS, pp.212-223, 2006.
DOI : 10.1007/11944836_21

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

C. Wu and Y. Lin, Minimizing Risk Models in Markov Decision Processes with Policies Depending on Target Values, Journal of Mathematical Analysis and Applications, vol.231, issue.1, pp.47-67, 1999.
DOI : 10.1006/jmaa.1998.6203

M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione, Regret minimization in games with incomplete information, Proc. of NIPS, pp.905-912, 2008.

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