T. Ågotnes, V. Goranko & W. Jamroga (2007):
Alternating-time Temporal Logics with Irrevocable Strategies.
In: D. Samet: Proceedings of TARK XI,
pp. 15–24,
doi:10.1145/1324249.1324256.
T. Ågotnes, V. Goranko & W. Jamroga (2008):
Strategic Commitment and Release in Logics for Multi-Agent Systems (Extended abstract).
Technical Report IfI-08-01.
Clausthal University of Technology.
Natasha Alechina, Brian Logan, Nguyen Hoang Nga & Abdur Rakib (2011):
Logic for coalitions with bounded resources.
J. Log. Comput. 21(6),
pp. 907–937,
doi:10.1093/logcom/exq032.
Luca de Alfaro, Thomas A. Henzinger & Orna Kupferman (2007):
Concurrent reachability games.
Theor. Comput. Sci. 386(3),
pp. 188–217,
doi:10.1016/j.tcs.2007.07.008.
R. Alur, T. A. Henzinger & O. Kupferman (2002):
Alternating-Time Temporal Logic.
Journal of the ACM 49,
pp. 672–713,
doi:10.1145/585265.585270.
Patricia Bouyer, Romain Brenguier, Nicolas Markey & Michael Ummels (2011):
Nash Equilibria in Concurrent Games with Büchi Objectives.
In: S. Chakraborty & A. Kumar: FSTTCS'2011 LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 375–386,
doi:10.4230/LIPIcs.FSTTCS.2011.375.
Patricia Bouyer, Romain Brenguier, Nicolas Markey & Michael Ummels (2012):
Concurrent Games with Ordered Objectives.
In: L. Birkedal: Proc. of FoSSaCS'2012, Springer LNCS, vol. 7213,
pp. 301–315,
doi:10.1007/978-3-642-28729-9_20.
T. Brihaye, A. Da Costa, F. Laroussinie & N. Markey (2008):
ATL with Strategy Contexts and Bounded Memory.
Technical Report LSV-08-14.
ENS Cachan,
doi:10.1007/978-3-540-92687-0_7.
Nils Bulling & Berndt Farwer (2010):
On the (Un-)Decidability of Model-Checking Resource-Bounded Agents.
In: H. Coelho & M. Wooldridge: Proc. of ECAI 2010.
IOS Press, Amsterdam,
pp. 567–572,
doi:10.3233/978-1-60750-606-5-567.
Krishnendu Chatterjee, Luca de Alfaro & Thomas A. Henzinger (2011):
Qualitative concurrent parity games.
ACM Trans. Comput. Log. 12(4),
pp. 28,
doi:10.1145/1970398.1970404.
Krishnendu Chatterjee & Laurent Doyen (2012):
Energy parity games.
Theor. Comput. Sci. 458,
pp. 49–60,
doi:10.1016/j.tcs.2012.07.038.
Krishnendu Chatterjee & Thomas A. Henzinger (2012):
A survey of stochastic ω-regular games.
J. Comput. Syst. Sci. 78(2),
pp. 394–413.
Available at http://dx.doi.org/10.1016/j.jcss.2011.05.002.
Javier Esparza:
Decidability of Model Checking for Infinite-State Concurrent Systems.
Acta Informatica 34,
pp. 85–107,
doi:10.1007/s002360050074.
Javier Esparza (1998):
Decidability and complexity of Petri net problems - an Introduction.
In: In Lectures on Petri Nets I: Basic Models.
Springer-Verlag,
pp. 374–428,
doi:10.1007/3-540-65306-6_20.
Valentin Goranko & Wojciech Jamroga (2004):
Comparing Semantics of Logics for Multi-agent Systems.
Synthese 139(2),
pp. 241–280,
doi:10.1023/B:SYNT.0000024915.66183.d1.
Erich Grädel & Michael Ummels (2008):
Solution Concepts and Algorithms for Infinite Multiplayer Games.
In: Krzysztof Apt & Robert van Rooij: New Perspectives on Games and Interaction,
Texts in Logic and Games 4.
Amsterdam University Press,
pp. 151–178.
Available at http://www.logic.rwth-aachen.de/~ummels/knaw07.pdf.
JE Hopcroft & JD Ullman (1979):
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley,
Reading, Massachusetts,
doi:10.1145/568438.568455.
W. Jamroga & T. Ågotnes (2007):
Constructive Knowledge: What Agents Can Achieve under Incomplete Information.
Journal of Applied Non-Classical Logics 17(4),
pp. 423–475,
doi:10.3166/jancl.17.423-475.
Dario Della Monica, Margherita Napoli & Mimmo Parente (2011):
On a Logic for Coalitional Games with Priced-Resource Agents.
Electr. Notes Theor. Comput. Sci. 278,
pp. 215–228,
doi:10.1016/j.entcs.2011.10.017.
M. Osborne & A. Rubinstein (1994):
A Course in Game Theory.
MIT Press.
M. Pauly (2002):
A Modal Logic for Coalitional Power in Games.
J. of Logic and Computation 12(1),
pp. 149–166,
doi:10.1093/logcom/12.1.149.
Sophie Pinchinat (2007):
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies.
In: K. Namjoshi et al: Proc. of ATVA'2007, Springer LNCS, vol. 4762,
pp. 253–267,
doi:10.1007/978-3-540-75596-8_19.
eptcs@eptcs.org