R. Alur, A. Kanade, and G. Weiss, Ranking Automata and Games for Prioritized Requirements, Computer Aided Verification, CAV, pp.240-253, 2008.
DOI : 10.1007/978-3-540-70545-1_23

R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann, Better Quality in Synthesis through Quantitative Objectives, Computer Aided Verification, CAV, pp.140-156, 2009.
DOI : 10.1007/978-3-642-02658-4_14

E. Boros and V. Gurvich, Why chess and back gammon can be solved in pure positional uniformly optimal strategies, Rutcor Research Report, vol.21, 2009.

P. Bouyer, R. Brenguier, and N. Markey, Nash Equilibria for Reachability Objectives in Multi-player Timed Games, Concurrency Theory, CONCUR, pp.192-206, 2010.
DOI : 10.1007/978-3-642-15375-4_14

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels, Nash equilibria in concurrent games with Büchi objectives, Foundations of Software Technology and Theoretical Computer Science, FSTTCS, volume 13 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.375-386, 2011.

T. Brihaye, V. Bruyère, and J. Pril, Equilibria in Quantitative Reachability Games, Computer Science Symposium in Russia, CSR, pp.72-83, 2010.
DOI : 10.1007/978-3-642-13182-0_7
URL : https://hal.archives-ouvertes.fr/hal-01006403

T. Brihaye, V. Bruyère, and J. Pril, On Equilibria in Quantitative Games with Reachability/Safety Objectives, Theory of Computing Systems, vol.36, issue.1, 2011.
DOI : 10.1007/s00224-013-9495-7

T. Brihaye, V. Bruyère, J. D. Pril, and H. Gimbert, Subgame Perfection for Equilibria in Quantitative Reachability Games, Foundations of Software Science and Computational Structures, FoSSaCS, pp.286-300, 2012.
DOI : 10.1007/978-3-642-28729-9_19
URL : https://hal.archives-ouvertes.fr/hal-01006403

K. Chatterjee, T. 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

K. Chatterjee and T. A. Henzinger, Finitary winning in omega-regular games, Tools and Algorithms for the Construction and Analysis of Systems, TACAS, pp.257-271, 2006.

K. Chatterjee and T. A. Henzinger, Assume-guarantee synthesis In Tools and Algorithms for the Construction and Analysis of Systems, TACAS, LNCS, vol.4424, pp.261-275, 2007.

K. Chatterjee and V. Raman, Assume-guarantee synthesis for digital contract signing. CoRR, abs, 1004.

E. Clarke, O. Grumberg, and D. Peled, Model Checking, 2000.

E. Grädel and M. Ummels, Solution concepts and algorithms for infinite multiplayer games, New Perspectives on Games and Interaction Logic and Games, pp.151-178, 2008.

J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages, and computation, 1979.

F. Horn, W. Thomas, and N. Wallmeier, Optimal strategy synthesis in requestresponse games, Automated Technology for Verification and Analysis, 6th International Symposium, ATVA, pp.361-373, 2008.

A. Kechris, Classical descriptive set theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

M. Klimos, K. G. Larsen, F. Stefanak, and J. Thaarup, Finding Nash equilibria in concurrent priced games, Language and Automata Theory and Applications, LATA, 2012.

H. Kuhn, 11. Extensive Games and the Problem of Information, Classics in Game Theory, pp.46-68, 1953.
DOI : 10.1515/9781400881970-012
URL : https://hal.archives-ouvertes.fr/hal-00143106

L. Roux, Acyclic preferences and existence of sequential Nash equilibria: A formal and constructive equivalence, Theorem Proving in Higher Order Logics, TPHOLs, pp.293-309, 2009.

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

J. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences, vol.36, issue.1, pp.48-49, 1950.
DOI : 10.1073/pnas.36.1.48

M. Osborne and A. Rubinstein, A course in game theory, 1994.

S. Paul, S. Simon, R. Kannan, and K. Kumar, Nash equilibrium in generalised muller games, Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp.335-346, 2009.

R. Selten, Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit, Zeitschrift für die gesamte Staatswissenschaft, vol.121, pp.301-324, 1965.

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

W. Thomas, Church???s Problem and a Tour through Automata Theory, Pillars of Computer Science, pp.635-655, 2008.
DOI : 10.1007/978-3-540-78127-1_35

M. Zimmermann, Time-Optimal Winning Strategies for Poset Games, Implementation and Application of Automata, CIAA, pp.217-226, 2009.
DOI : 10.1016/0304-3975(95)00188-3