]. R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time. Information and computation, Bibliography, vol.104, issue.1, pp.2-34, 1993.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.
DOI : 10.1145/585265.585270

G. Behrmann, A. Cougnard, A. David, E. Fleury, K. G. Larsen et al., UPPAAL-Tiga: Time for playing games! In CAV'07, LNCS, vol.4590, pp.121-125, 2007.

J. Bengtsson, K. Larsen, F. Larsson, P. Pettersson, and W. Yi, Uppaal?a tool suite for automatic verification of real-time systems, Hybrid Systems III, pp.232-243, 1996.

P. Bouyer, R. Brenguier, and N. Markey, Nash Equilibria for Reachability Objectives in Multi-player Timed Games, Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), 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, Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.375-386, 2011.

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels, Pure Nash equilibria in concurrent games ? part II: Ordered objectives, 2012.

P. Bouyer, D. Souza, P. Madhusudan, and A. Petit, Timed Control with Partial Observability, Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03), pp.180-192, 2003.
DOI : 10.1007/978-3-540-45069-6_18

T. Brihaye, V. Bruyère, and J. Pril, Equilibria in Quantitative Reachability Games, Computer Science ? Theory and Applications, pp.72-83, 2010.
DOI : 10.1007/978-3-642-13182-0_7

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

J. R. Burch, E. M. Clarke, K. L. Mcmillan, and D. L. Dill, Sequential circuit verification using symbolic model checking, Conference proceedings on 27th ACM/IEEE design automation conference , DAC '90, pp.46-51, 1990.
DOI : 10.1145/123186.123223

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. F. Raskin, Generalized mean-payoff and energy games, 2010.

K. Chatterjee, T. A. Henzinger, and N. Piterman, Generalized Parity Games, Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'07), pp.153-167, 2007.
DOI : 10.1007/978-3-540-71389-0_12

K. Chatterjee, R. Majumdar, and M. Jurdzi´nskijurdzi´nski, On Nash Equilibria in Stochastic Games, Proceedings of the 18th International Workshop on Computer Science Logic, pp.26-40
DOI : 10.1007/978-3-540-30124-0_6

A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri, NuSMV: A New Symbolic Model Verifier, Computer Aided Verification, pp.682-682
DOI : 10.1007/3-540-48683-6_44

S. Conchon, J. C. Filliâtre, and J. Signoles, Designing a generic graph library using ml functors, TFP, vol.7, pp.124-140, 2008.

A. A. Cournot and I. Fisher, Researches into the Mathematical Principles of the Theory of Wealth, p.1897

J. Cristau, C. David, and F. Horn, How do we remember the past in randomised strategies?, Electronic Proceedings in Theoretical Computer Science, 2010.
DOI : 10.4204/EPTCS.25.7

C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, The complexity of computing a nash equilibrium, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp.71-78, 2006.

A. Dawar, F. Horn, and P. Hunter, Complexity bounds for Muller games, Theoretical Computer Science, 2011.

L. De-alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, The Element of Surprise in Timed Games, Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), pp.142-156, 2003.
DOI : 10.1007/978-3-540-45187-7_9

L. De-alfaro, T. Henzinger, and R. Majumdar, Symbolic Algorithms for Infinite-State Games, pp.536-550, 2001.
DOI : 10.1007/3-540-44685-0_36

E. A. Emerson and C. S. Jutla, The complexity of tree automata and logics of programs, Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS'88), pp.328-337, 1988.

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.368-377, 1991.
DOI : 10.1109/SFCS.1991.185392

I. Gilboa and E. Zemel, Nash and correlated equilibria: Some complexity considerations, Games and Economic Behavior, vol.1, issue.1, pp.80-93, 1989.
DOI : 10.1016/0899-8256(89)90006-7

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

G. Gottlob, NP trees and Carnap's modal logic, Journal of the ACM, vol.42, issue.2, pp.421-457, 1995.
DOI : 10.1145/201019.201031

G. Gottlob, G. Greco, and F. Scarcello, Pure Nash equilibria, Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge , TARK '03, pp.215-230, 2003.
DOI : 10.1145/846241.846269

T. A. Henzinger, P. H. Ho, and H. Wong-toi, HYTECH: a??model checker for hybrid systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.110-122, 1997.
DOI : 10.1007/s100090050008

T. A. Henzinger and P. W. Kopke, Discrete-time control for rectangular hybrid automata, Theoretical Computer Science, vol.221, issue.1-2, pp.369-392, 1999.
DOI : 10.1016/S0304-3975(99)00038-9

G. J. Holzmann, Design and validation of protocols: a tutorial, Computer Networks and ISDN Systems, vol.25, issue.9, pp.981-1017, 1993.
DOI : 10.1016/0169-7552(93)90095-L

G. J. Holzmann, The model checker spin. Software Engineering, IEEE Transactions on, vol.23, issue.5, pp.279-295, 1997.

F. Horn, Streett games on finite graphs, Proceedings of the 2nd Workshop on Games in Design and Verification (GDV'05), 2005.
URL : https://hal.archives-ouvertes.fr/hal-00153601

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

M. Jurdzi´nskijurdzi´nski, F. Laroussinie, and J. Sproston, Model Checking Probabilistic Timed Automata with One or Two Clocks, Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), pp.170-184, 2007.
DOI : 10.1007/978-3-540-71209-1_15

M. Klimo?, K. Larsen, F. Stefa?ák, and J. Thaarup, Nash equilibria in concurrent priced games. Language and Automata Theory and Applications, pp.363-376, 2012.

D. Kozen, Lower bounds for natural proof systems, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.254-266, 1977.
DOI : 10.1109/SFCS.1977.16

F. Laroussinie, N. Markey, and G. Oreiby, On the expressiveness and complexity of ATL, Logicical Methods in Computer Science, vol.4, issue.2, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194605

A. B. Mackenzie and S. Wicker, Game theory and the design of self-configuring, adaptive wireless networks, IEEE Communications Magazine, vol.39, issue.11, pp.39126-131, 2001.
DOI : 10.1109/35.965370

A. B. Mackenzie and S. Wicker, Game theory in communications: motivation, explanation, and application to power control, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), pp.821-826, 2001.
DOI : 10.1109/GLOCOM.2001.965533

A. B. Mackenzie and S. Wicker, Stability of multipacket slotted Aloha with selfish users and perfect information, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.1583-1590, 2003.
DOI : 10.1109/INFCOM.2003.1209181

O. Morgenstern and J. V. Neumann, Theory of games and economic behavior, 1953.

A. W. Mostowski, Games with forbidden positions, UG, 1991.

J. F. Nash and J. , Equilibrium points in n-person games, Proc. National Academy of Sciences of the USA, pp.48-49, 1950.

P. Ramadge and W. Wonham, Supervisory Control of a Class of Discrete Event Processes, SIAM Journal on Control and Optimization, vol.25, issue.1, pp.206-230, 1987.
DOI : 10.1137/0325013

D. Rosenberg, E. Solan, and N. Vieille, Stochastic games with imperfect monitoring Advances in Dynamic Games, pp.3-22, 2006.

C. U. Saraydar, N. B. Mandayam, and D. J. Goodman, Pareto efficiency of pricing-based power control in wireless data networks, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), pp.231-235, 1999.
DOI : 10.1109/WCNC.1999.797821

J. M. Smith and G. R. Price, The Logic of Animal Conflict, Nature, vol.62, issue.5427, p.15, 1973.
DOI : 10.1038/246015a0

M. Ummels, The Complexity of Nash Equilibria in Infinite Multiplayer Games, Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'08), pp.20-34, 2008.
DOI : 10.1007/978-3-540-78499-9_3

M. Ummels, Stochastic multiplayer games: Theory and algorithms, 2010.
DOI : 10.5117/9789085550402

M. Ummels and D. Wojtczak, The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games, Automata, Languages and Programming, pp.297-308, 2009.
DOI : 10.1007/978-3-642-02930-1_25

M. Ummels and D. Wojtczak, The complexity of nash equilibria in limitaverage games, CONCUR 2011?Concurrency Theory, pp.482-496, 2011.

J. Neumann, Zur Theorie der Gesellschaftsspiele, Mathematische Annalen, vol.100, issue.1, pp.295-320, 1928.
DOI : 10.1007/BF01448847

N. Wallmeier, P. Hütten, and W. Thomas, Symbolic synthesis of finitestate controllers for request-response specifications. Implementation and Application of Automata, pp.113-127, 2003.

S. Yovine, KRONOS: a??verification tool for real-time systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.123-133, 1997.
DOI : 10.1007/s100090050009