Dietmar Berwanger (2007):
Admissibility in Infinite Games.
In: STACS,
LNCS 4393.
Springer,
pp. 188–199,
doi:10.1007/978-3-540-70918-3_17.
Patricia Bouyer, Romain Brenguier, Nicolas Markey & Michael Ummels (2015):
Pure Nash Equilibria in Concurrent Deterministic Games.
Logical Methods in Computer Science 11(2),
doi:10.2168/LMCS-11(2:9)2015.
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur & Mathieu Sassolas (2016):
Non-Zero Sum Games for Reactive Synthesis.
In: LATA,
LNCS 9618.
Springer,
pp. 3–23,
doi:10.1007/978-3-319-30000-9_1.
Romain Brenguier, Jean-François Raskin & Mathieu Sassolas (2014):
The complexity of admissibility in Omega-regular games.
In: CSL-LICS.
ACM,
pp. 23:1–23:10,
doi:10.1145/2603088.2603143.
Thomas Brihaye, Véronique Bruyère, Julie De Pril & Hugo Gimbert (2012):
On Subgame Perfection in Quantitative Reachability Games.
Logical Methods in Computer Science 9,
doi:10.1007/978-3-642-28729-9_19.
Thomas Brihaye, Véronique Bruyère, Noémie Meunier & Jean-François Raskin (2015):
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
In: CSL,
LIPIcs 41.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 504–518,
doi:10.4230/LIPIcs.CSL.2015.504.
Véronique Bruyère (2017):
Computer Aided Synthesis: A Game-Theoretic Approach.
In: DLT,
LNCS 10396.
Springer,
pp. 3–35,
doi:10.1007/978-3-319-62809-7_1.
Véronique Bruyère, Quentin Hautem & Jean-François Raskin (2017):
Games with lexicographically ordered ω-regular objectives.
CoRR abs/1707.05968.
Véronique Bruyère, Noémie Meunier & Jean-François Raskin (2014):
Secure equilibria in weighted games.
In: CSL-LICS.
ACM,
pp. 26:1–26:26,
doi:10.1145/2603088.2603109.
Véronique Bruyère, Stéphane Le Roux, Arno Pauly & Jean-François Raskin (2017):
On the Existence of Weak Subgame Perfect Equilibria.
In: FOSSACS,
LNCS 10203,
pp. 145–161,
doi:10.1007/978-3-662-54458-7_9.
K. Chatterjee, T. A. Henzinger & M. Jurdzinski (2006):
Games with secure equilibria.
Theoretical Computer Science 365,
pp. 67–82,
doi:10.1016/j.tcs.2006.07.032.
Krishnendu Chatterjee, Thomas A. Henzinger & Nir Piterman (2007):
Generalized Parity Games.
In: FOSSACS,
LNCS 4423.
Springer,
pp. 153–167,
doi:10.1007/978-3-540-71389-0_12.
Rodney G. Downey & M. R. Fellows (2012):
Parameterized Complexity.
Springer Publishing Company, Incorporated,
doi:10.1007/978-1-4612-0515-9.
E. Allen Emerson & Chin-Laung Lei (1987):
Modalities for Model Checking: Branching Time Logic Strikes Back.
Science of Computer Programming 8(3),
pp. 275–306,
doi:10.1016/0167-6423(87)90036-0.
Dana Fisman, Orna Kupferman & Yoad Lustig (2010):
Rational Synthesis.
In: TACAS,
LNCS 6015.
Springer,
pp. 190–204,
doi:10.1007/978-3-642-12002-2_16.
János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan & Koos Vrieze (2010):
Perfect-Information Games with Lower-Semicontinuous Payoffs.
Mathematics of Operation Research 35,
pp. 742–755,
doi:10.1287/moor.1100.0469.
D. Fudenberg & J. Tirole (1991):
Game Theory.
MIT Press.
Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
Erich Grädel & Michael Ummels (2008):
Solution Concepts and Algorithms for Infinite Multiplayer Games.
In: New Perspectives on Games and Interaction 4.
Amsterdam University Press,
pp. 151–178.
Orna Kupferman, Giuseppe Perelli & Moshe Y. Vardi (2014):
Synthesis with Rational Environments.
In: EUMAS,
LNCS 8953.
Springer,
pp. 219–235,
doi:10.1007/978-3-319-17130-2_15.
J. F. Nash (1950):
Equilibrium points in n-person games.
In: PNAS 36.
National Academy of Sciences,
pp. 48–49,
doi:10.1073/pnas.36.1.48.
Martin J. Osborne (2004):
An introduction to game theory.
Oxford Univ. Press.
A. Pnueli & R. Rosner (1989):
On the Synthesis of a Reactive Module.
In: POPL.
ACM Press,
pp. 179–190,
doi:10.1145/75277.75293.
Wolfgang Thomas (1995):
On the Synthesis of Strategies in Infinite Games.
In: STACS.
Springer,
pp. 1–13,
doi:10.1007/3-540-59042-0_57.
Michael Ummels (2006):
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games.
In: FSTTCS,
LNCS 4337.
Springer,
pp. 212–223,
doi:10.1007/11944836_21.
Michael Ummels (2008):
The Complexity of Nash Equilibria in Infinite Multiplayer Games.
In: FOSSACS,
LNCS 4962.
Springer,
pp. 20–34,
doi:10.1007/978-3-540-78499-9_3.
eptcs@eptcs.org