Local Equilibria in Logic-Based Multi-Player Games

Game theory provides a well-established framework for the analysis and verification of concurrent and multi-agent systems. Typically, the analysis of a multi-agent system involves computing the set of equilibria in the associated multi-player game representing the behaviour of the system. As systems grow larger, it becomes increasingly harder to find equilibria in the game -- which represent the rationally stable behaviours of the multi-agent system (the solutions of the game). To address this issue, in this paper, we study the concept of local equilibria, which are defined with respect to (maximal) stable coalitions of agents for which an equilibrium can de found. We focus on the solutions given by the Nash equilibria of Boolean games and iterated Boolean games, two logic-based models for multi-agent systems, in which the players' goals are given by formulae of propositional logic and LTL, respectively.

[1]  S. Shankar Sastry,et al.  On the Characterization of Local Nash Equilibria in Continuous Games , 2014, IEEE Transactions on Automatic Control.

[2]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

[3]  Michael Wooldridge,et al.  From model checking to equilibrium checking: Reactive modules for rational verification , 2016, Artif. Intell..

[4]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

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

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

[7]  Ana B. Ania,et al.  Local equilibria in economic games , 2001 .

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

[9]  Alessio Lomuscio,et al.  MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications , 2014, CAV.

[10]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[11]  Michael Wooldridge,et al.  Iterated Boolean games , 2013, Inf. Comput..

[12]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  Jihong Guan,et al.  Local Nash Equilibrium in Social Networks , 2014, Scientific Reports.

[14]  Michael Wooldridge,et al.  Rational Verification: From Model Checking to Equilibrium Checking , 2016, AAAI.

[15]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[16]  Alessio Lomuscio,et al.  MCMAS: an open-source model checker for the verification of multi-agent systems , 2017, International Journal on Software Tools for Technology Transfer.