[BBDG12] Thomas Brihaye, Véronique Bruyère, Julie De Pril, and Hugo Gimbert. On subgame perfection in quantitative reachability games. Logical Methods in Computer Science, 9(1), 2012.
[BBG+ 19] Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, and Marie van den Bogaard. The complexity of subgame perfect equilibria in quantitative reachability games. In CONCUR, volume 140 of LIPIcs, pages 13:1–13:16. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2019.
[BBGR18a] Thomas Brihaye, Véronique Bruyère, Aline Goeminne, and Jean-François Raskin. Constrained existence problem for weak subgame perfect equilibria with ω-regular boolean objectives. In GandALF 2018, pages 16–29, 2018.
[BBGR18b] Thomas Brihaye, Véronique Bruyère, Aline Goeminne, and Jean-François Raskin. Constrained existence problem for weak subgame perfect equilibria with omega-regular boolean objectives. CoRR, abs/1806.05544, 2018.
[BBGT19] Thomas Brihaye, Véronique Bruyère, Aline Goeminne, and Nathan Thomasset. On relevant equilibria in reachability games. In RP 2019, pages 48–62, 2019.
[BBMR15] Thomas Brihaye, Véronique Bruyère, Noémie Meunier, and Jean-François Raskin. Weak subgame perfect equilibria and their application to quantitative reachability. In CSL, volume 41 of LIPIcs, pages 504–518. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015.
[BCH+ 16] Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, and Mathieu Sassolas. Non-zero sum games for reactive synthesis. In LATA, volume 9618 of LNCS, pages 3–23. Springer, 2016.
[BDS13] Thomas Brihaye, Julie De Pril, and Sven Schewe. Multiplayer cost games with simple nash equilibria. In LFCS, volume 7734 of LNCS, pages 59–73. Springer, 2013.
[Ber07] Dietmar Berwanger. Admissibility in infinite games. In STACS, volume 4393 of LNCS, pages 188–199. Springer, 2007.
[BJP+ 18] Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, and Marie van den Bogaard. Beyond admissibility: Dominance between chains of strategies. In CSL, volume 119 of LIPIcs, pages 10:1–10:22. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
[BPRS16] Romain Brenguier, Guillermo A. Pérez, Jean-Francois Raskin, and Ocan Sankur. Admissibility in Quantitative Graph Games. In FSTTCS, volume 65 of LIPIcs, pages 42:1–42:14, 2016.
[BPRS17] Romain Brenguier, Arno Pauly, Jean-François Raskin, and Ocan Sankur. Admissibility in Games with Imperfect Information (Invited Talk). In CONCUR, volume 85 of LIPIcs, pages 2:1–2:23. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017.
[BRPR17] Véronique Bruyère, Stéphane Le Roux, Arno Pauly, and Jean-François Raskin. On the existence of weak subgame perfect equilibria. In FOSSACS, volume 10203 of LNCS, pages 145–161, 2017.
[BRS14] Romain Brenguier, Jean-François Raskin, and Mathieu Sassolas. The complexity of admissibility in omega-regular games. In CSL-LICS, pages 23:1–23:10. ACM, 2014.
[BRS15] Romain Brenguier, Jean-François Raskin, and Ocan Sankur. Assume-admissible synthesis. In CONCUR, LIPIcs 42, pages 100–113. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015.
[Bru17] Véronique Bruyère. Computer aided synthesis: A game-theoretic approach. In DLT, volume 10396 of LNCS, pages 3–35. Springer, 2017.
[CFGR16] Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin. The complexity of rational synthesis. In ICALP, volume 55 of LIPIcs, pages 121:1–121:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.
[CHJ06] K. Chatterjee, T. A. Henzinger, and M. Jurdzinski. Games with secure equilibria. Theoretical Computer Science, 365:67–82, 2006.
[CHP10] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy logic. Inf. Comput., 208(6):677–693, 2010.
[FGR18] Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin. Rational synthesis under imperfect information. In LICS, pages 422–431. ACM, 2018.
[FKL10] Dana Fisman, Orna Kupferman, and Yoad Lustig. Rational synthesis. In TACAS, volume 6015 of LNCS, pages 190–204. Springer, 2010.
[FKM+ 10] János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan, and Koos Vrieze. Perfect-information games with lower-semicontinuous payoffs. Mathematics of Operation Research, 35:742–755, 2010.
[FL83] Drew Fudenberg and David Levine. Subgame-perfect equilibria of finite-and infinite-horizon games. Journal of Economic Theory, 31:251–268, 1983.
[GU08] Erich Grädel and Michael Ummels. Solution Concepts and Algorithms for Infinite Multiplayer Games. In New Perspectives on Games and Interaction, volume 4, pages 151–178. Amsterdam University Press, 2008.
[KPV14] Orna Kupferman, Giuseppe Perelli, and Moshe Y. Vardi. Synthesis with rational environments. In EUMAS, LNCS 8953, pages 219–235. Springer, 2014.
[Kuh53] H.W. Kuhn. Extensive games and the problem of information. In Classics in Game Theory, pages 46–68. Princeton University Press, 1953.
[MMV10] Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi. Reasoning About Strategies. In FSTTCS 2010, volume 8 of LIPIcs, pages 133–144. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2010.
[Nas50] J. F. Nash. Equilibrium points in n-person games. In PNAS, volume 36, pages 48–49. National Academy of Sciences, 1950.
[Osb04] Martin J. Osborne. An introduction to game theory. Oxford Univ. Press, 2004.
[PR89] A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, pages 179–190. ACM Press, 1989.
[SV03] Eilon Solan and Nicolas Vieille. Deterministic multi-player Dynkin games. Journal of Mathemat-ical Economics, 39:911–929, 2003.
[Umm06] Michael Ummels. Rational behaviour and strategy construction in infinite multiplayer games. In FSTTCS, volume 4337 of LNCS, pages 212–223. Springer, 2006.
[Umm08] Michael Ummels. The complexity of nash equilibria in infinite multiplayer games. In FOSSACS, volume 4962 of LNCS, pages 20–34. Springer, 2008.
[UW11] Michael Ummels and Dominik Wojtczak. The complexity of Nash equilibria in limit-average games. In CONCUR, volume 6901 of Lecture Notes in Comput. Sci., pages 482–496. Springer, 2011.
