Equilibria of concurrent games on event structures

Event structures form a canonical model of concurrent behaviour which has a natural game-theoretic interpretation. This game-based interpretation was initially given for zero-sum concurrent games. This paper studies an extension of such games on event structures to include a much wider class of game types and solution concepts. The extension permits modelling scenarios where, for instance, cooperation or independent goal-driven behaviour of computer agents is desired. Specifically, we will define non-zero-sum games on event structures, and give full characterisations---existence and completeness results---of the kinds of games, payoff sets, and strategies for which Nash equilibria and subgame perfect Nash equilibria always exist. The game semantics of various logics and systems are outlined to illustrate the power of this framework.

[1]  Dominik Wojtczak,et al.  Decision Problems for Nash Equilibria in Stochastic Games , 2009, CSL.

[2]  G. Winskel.  Distributed Probabilistic Strategies , 2013 .

[3]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[4]  Erich Grädel.  Model Checking Games , 2002, Electron. Notes Theor. Comput. Sci..

[5]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[6]  Samson Abramsky,et al.  Sequentiality vs. concurrency in games and logic , 2003, Mathematical Structures in Computer Science.

[7]  Krishnendu Chatterjee,et al.  A survey of stochastic ω-regular games , 2012, J. Comput. Syst. Sci..

[8]  Glynn Winskel,et al.  Imperfect Information in Logic and Concurrent Games , 2013, Computation, Logic, Games, and Quantum Foundations.

[9]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[10]  Glynn Winskel,et al.  On the determinacy of concurrent games on event structures with infinite winning sets , 2014, J. Comput. Syst. Sci..

[11]  Dan R. Ghica.  Applications of Game Semantics: From Program Analysis to Hardware Synthesis , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[12]  Robert J. Aumann,et al.  16. Acceptable Points in General Cooperative n-Person Games , 1959 .

[13]  Patricia Bouyer,et al.  Concurrent Games with Ordered Objectives , 2012, FoSSaCS.

[14]  J. Hintikka.  A Revolution in Logic , 1998 .

[15]  S. Abramsky.  Game Semantics , 1999 .

[16]  Michael Ummels,et al.  Solution Concepts and Algorithms for Infinite Multiplayer Games , 2008 .

[17]  Glynn Winskel.  Strategies as Profunctors , 2013, FoSSaCS.

[18]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games , 2009, ICALP.

[19]  Glynn Winskel,et al.  The Winning Ways of Concurrent Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[20]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[21]  Nicolas Vieille,et al.  Two-player stochastic games II: The case of recursive games , 2000 .

[22]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[23]  Glynn Winskel,et al.  Borel Determinacy of Concurrent Games , 2013, CONCUR.

[24]  Glynn Winskel,et al.  Concurrent Strategies , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[25]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[26]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[27]  Krishnendu Chatterjee,et al.  Environment Assumptions for Synthesis , 2008, CONCUR.

[28]  Glynn Winskel,et al.  On Concurrent Games with Payoff , 2013, MFPS.

[29]  Johan van Benthem,et al.  Logic Games: From Tools to Models of Interaction , 2011, Proof, Computation and Agency.

[30]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[31]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[32]  Krishnendu Chatterjee,et al.  On Nash Equilibria in Stochastic Games , 2004, CSL.

[33]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[34]  Glynn Winskel,et al.  Distributed Probabilistic and Quantum Strategies , 2013, MFPS.

[35]  Krishnendu Chatterjee.  Two-Player Nonzero-Sum omega-Regular Games , 2005, CONCUR.

[36]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[37]  Mathijs de Weerdt,et al.  Introduction to Mechanism Design , 2009 .

[38]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[39]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Limit-Average Games , 2011, CONCUR.

[40]  W. Browder,et al.  Annals of Mathematics , 1889 .

[41]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[42]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[43]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[44]  S. Abramsky.  Semantics of Interaction: an introduction to Game Semantics , 1997 .

[45]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .