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

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

C. Baier and J. Katoen, Principles of Model Checking (Representation and Mind Series), 2008.

N. Basset, G. Geeraerts, J. Raskin, and O. Sankur, Admissibility in concurrent games

D. Berwanger, Admissibility in Infinite Games, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science Proceedings, number 4393 in Lecture Notes in Computer Science, pp.188-199, 2007.
DOI : 10.1007/978-3-540-70918-3_17

P. Bouyer, R. Brenguier, N. Markey, and M. Ummels, Nash equilibria in concurrent games with Büchi objectives, Proceedings of the 31st Conference on Found- I C A L P 2

R. Brenguier, G. A. Pérez, J. Raskin, and O. Sankur, Admissibility in Quantitative Graph Games, Akash Lal, S. Akshay, Saket Saurabh, and Sandeep Sen 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), volume 65 of Leibniz International Proceedings in Informatics (LIPIcs), pp.1-42, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01373542

R. Brenguier, J. Raskin, and O. Sankur, Assume-admissible synthesis, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.100-113, 2015.
DOI : 10.5117/9789085550402
URL : https://hal.archives-ouvertes.fr/hal-01245193

R. Brenguier, J. Raskin, and O. Sankur, Assume-admissible synthesis, Acta Informatica, vol.59, issue.6, pp.41-8310, 2017.
DOI : 10.5117/9789085550402
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

. 11-krishnendu-chatterjee, T. A. Luca-de-alfaro, and . Henzinger, Qualitative concurrent parity games, ACM Trans. Comput. Log, vol.1228, issue.4, pp.1-28, 1970398.

K. Chatterjee and T. A. Henzinger, Assume-Guarantee Synthesis, 13th International Conference Proceedings, pp.261-275, 2007.
DOI : 10.1007/978-3-540-71209-1_21
URL : http://pub.ist.ac.at/~tah/Publications/assume-guarantee_synthesis.pdf

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

T. A. Luca-de-alfaro, O. Henzinger, and . Kupferman, Concurrent reachability games, Theoretical Computer Science, vol.386, issue.3, pp.188-217, 2007.
DOI : 10.1016/j.tcs.2007.07.008

M. Faella, Admissible Strategies in Infinite Games over Graphs, MFCS 2009, pp.307-318, 2009.
DOI : 10.1016/S0304-3975(98)00009-7
URL : http://people.na.infn.it/~mfaella/Download/mfcs09-admissible.pdf

O. Fisman, Y. Kupferman, and . Lustig, Rational Synthesis, 16th International Conference Proceedings, pp.190-204, 2010.
DOI : 10.1007/978-3-642-12002-2_16

O. Kupferman, G. Perelli, and M. Y. Vardi, Synthesis with rational environments, Multi-Agent Systems -12th European Conference, pp.219-235, 2014.
DOI : 10.1007/978-3-319-17130-2_15
URL : http://www.cs.rice.edu/%7Evardi/papers/eumas14.pdf

K. Jean-françois-raskin, L. Chatterjee, T. A. Doyen, and . Henzinger, Algorithms for omega-regular games with imperfect information, Logical Methods in Computer Science, vol.33, issue.34, pp.10-2168, 2007.

Y. Moshe and . Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on, pp.327-338, 1985.