B. Adam, F. Amanda, and . Jerome, Admissibility in games, Econometrica, 2008.

J. Bernet, D. Janin, and I. Walukiewicz, Permissive strategies: from parity games to safety games, Theoretical Informatics and Applications-Informatique Théorique et Applications, pp.261-275, 2002.
DOI : 10.1051/ita:2002013
URL : https://hal.archives-ouvertes.fr/hal-00306411

D. Berwanger, Admissibility in Infinite Games, Proc. of STACS'07, 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, SYNT'14, pp.34-50, 2014.
DOI : 10.4204/EPTCS.157.7

R. Brenguier, J. Raskin, and O. Sankur, Assume-admissible synthesis, Luca Aceto and David de Frutos Escrig 26th International Conference on Concurrency Theory (CONCUR 2015), volume 42 of Leibniz International Proceedings in Informatics (LIPIcs), pp.100-113
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, 2014.
DOI : 10.1145/2603088.2603143
URL : https://hal.archives-ouvertes.fr/hal-01161868

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

K. Chatterjee, A. Thomas, and . Henzinger, Assume-Guarantee Synthesis, TACAS'07, 2007.
DOI : 10.1007/978-3-540-71209-1_21

K. Chatterjee, T. A. Henzinger, and B. Jobstmann, Environment Assumptions for Synthesis, LNCS, vol.5201, pp.147-161, 2008.
DOI : 10.1007/978-3-540-85361-9_14

K. Chatterjee, A. Thomas, M. Henzinger, and . 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, T. A. Henzinger, and N. Piterman, Strategy logic, Information and Computation, vol.208, issue.6, pp.677-693, 2010.
DOI : 10.1016/j.ic.2009.07.004

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

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

W. Damm and B. Finkbeiner, Automatic Compositional Synthesis of Distributed Systems, FM 2014, pp.179-193, 2014.
DOI : 10.1007/978-3-319-06410-9_13

P. Luca-de-alfaro, R. Godefroid, and . Jagadeesan, Three-valued abstractions of games: uncertainty, but with precision, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004.
DOI : 10.1109/LICS.2004.1319611

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

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

D. Fudenberg and J. Tirole, Game Theory, 1991.

Z. Han, Game theory in wireless and communication networks: theory, models, and applications, 2012.
DOI : 10.1017/CBO9780511895043

T. A. Henzinger, R. Majumdar, F. Y. Mang, and J. Raskin, Abstract Interpretation of Game Properties, SAS, pp.220-239, 2000.
DOI : 10.1007/978-3-540-45099-3_12

P. Hunter, Complexity and Infinite Games on Finite Graphs, 2007.

P. Hunter and A. Dawar, Complexity Bounds for Regular Games, MFCS'05, 2005.
DOI : 10.1007/11549345_43

O. Kupferman, G. Perelli, and M. Y. Vardi, Synthesis with rational environments, Proc. 12th European Conference on Multi-Agent Systems, 2014.

E. David, A. Long, E. M. Browne, S. Clarke, W. R. Jha et al., An improved algorithm for the evaluation of fixpoint expressions, CAV'94, 1994.

Z. Manna and P. Wolper, Synthesis of communicating processes from temporal logic specifications, Logics of Programs, pp.253-281, 1981.

F. Mogavero, A. Murano, and M. Y. Vardi, Reasoning about strategies, FSTTCS 2010 of LIPIcs. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2010.

J. Nash, Equilibrium points in n-person games, Proc. NAS, 1950.

D. Neider, R. Rabinovich, and M. Zimmermann, Down the Borel hierarchy: Solving Muller games via safety games, Theoretical Computer Science, vol.560, pp.219-234, 2014.
DOI : 10.1016/j.tcs.2014.01.017

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

H. Seidl, Fast and simple nested fixpoints, Proc. Letters, pp.303-308, 1996.
DOI : 10.1016/0020-0190(96)00130-5

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