1. Lecture Notes in Computer Science;D Berwanger,2007
2. Lecture Notes in Computer Science;R Brenguier,2016
3. Brenguier, R., Raskin, J.-F., Sankur, O.: Assume-admissible synthesis. In: CONCUR, LIPIcs, vol. 42, pp. 100–113. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)
4. Brenguier, R., Raskin, J.-F., Sassolas, M.: The complexity of admissibility in omega-regular games. In: CSL-LICS, pp. 23:1–23:10. ACM (2014)
5. Brihaye, T., Bruyère, V., Meunier, N., Raskin, J.-F.: Weak subgame perfect equilibria and their application to quantitative reachability. In: CSL, LIPIcs, vol. 41, pp. 504–518. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)