M. Abadi, L. Lamport, and P. Wolper, Realizable and unrealizable specifications of reactive systems, ICALP'89, 1989.
DOI : 10.1007/BFb0035748

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

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

N. Basset and G. Geeraerts, Jean-François Raskin, and Ocan Sankur Admissibility in concurrent games, 1702.

R. Berthon, B. Maubert, A. Murano, S. Rubin, and M. Vardi, Strategy logic with imperfect information, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014.
DOI : 10.1109/LICS.2017.8005136

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

M. Mathew, . Van-den, and . Bogaard, Hierarchical information patterns and distributed strategy synthesis, XX:22 Admissibility in Games with Imperfect Information 7 Dietmar Berwanger Automated Technology for Verification and Analysis -13th International Symposium, ATVA 2015 Proceedings, pp.378-393, 2015.

M. Brandt, F. Brill, P. Fischer, and . Harrenstein, On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems, pp.162-181, 2011.

R. Brenguier, L. Clemente, P. Hunter, G. A. Pérez, M. Randour et al., Non-Zero Sum Games for Reactive Synthesis, Language and Automata Theory and Applications -10th International Conference Proceedings, volume 9618 of Lecture Notes in Computer Science, pp.3-23, 2016.
DOI : 10.1007/978-3-319-30000-9_1
URL : https://hal.archives-ouvertes.fr/hal-01373546

R. Brenguier, G. A. Pérez, J. Raskin, and O. Sankur, Admissibility in quantitative graph games, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016 Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, pp.1-42, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01373542

R. Brenguier, J. Raskin, and O. Sankur, Assume-admissible synthesis, Acta Informatica, vol.59, issue.6
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

L. 13-krishnendu-chatterjee, T. A. Doyen, J. Henzinger, and . Raskin, Algorithms for omega-regular games with imperfect information, Logical Methods in Computer Science, vol.3, issue.4, 2007.

T. A. 14-krishnendu-chatterjee, N. Henzinger, and . Piterman, Strategy logic, Information and Computation, vol.208, issue.6, pp.677-693, 2010.
DOI : 10.1016/j.ic.2009.07.004

V. Conitzer and T. Sandholm, Complexity of (iterated) dominance, Proceedings of the 6th ACM conference on Electronic commerce , EC '05, pp.88-97, 2005.
DOI : 10.1145/1064009.1064019
URL : http://www.cs.cmu.edu/~conitzer/dominanceEC05.pdf

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

T. A. Luca-de-alfaro, O. Henzinger, and . Kupferman, Concurrent reachability games, 39th Annual Symposium on Foundations of Computer Science, FOCS '98, pp.564-575, 1998.

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

D. Kirsten, Alternating Tree Automata and Parity Games, Automata, Logics, and Infinite Games, pp.153-167, 2001.
DOI : 10.1007/3-540-36387-4_9

D. Knuth, C. Papadimitriou, and J. Tsitsiklis, A note on strategy elimination in bimatrix games, Operations Research Letters, vol.7, issue.3, pp.103-107, 1988.
DOI : 10.1016/0167-6377(88)90075-2
URL : http://dspace.mit.edu/bitstream/handle/1721.1/3017/P-1705-18394740.pdf?sequence=1

O. Kupferman and M. Y. Vardi, Synthesis with incomplete informatio, Advances in Temporal Logic, pp.109-127, 2000.

F. Mogavero, A. Murano, and M. Y. Vardi, Reasoning about strategies, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.133-144, 2010.

A. Pauly, The Computational Complexity of Iterated Elimination of Dominated Strategies, Theory of Computing Systems, pp.52-75, 2016.
DOI : 10.2307/1911197

A. Pnueli and R. Rosner, On the synthesis of a reactive module, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.179-190, 1989.
DOI : 10.1145/75277.75293

J. H. Reif, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol.29, issue.2, pp.274-301, 1984.
DOI : 10.1016/0022-0000(84)90034-5