Relaxing Exclusive Control in Boolean Games

In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. In standard BG goals are propositional formulas, whereas in iterated BG goals are formulas of Linear Temporal Logic. Both notions of BG are characterised by the fact that agents have exclusive control over their set of atoms, meaning that no two agents can control the same atom. In the present contribution we drop the exclusivity assumption and explore structures where an atom can be controlled by multiple agents. We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they account for several classes of repeated games, including iterated boolean games, influence games, and aggregation games. Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control. This result provides a polynomial reduction for the model checking problem of specifications in Alternating-time Temporal Logic on CGS-SPC.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Omer Lev,et al.  Convergence of iterative voting , 2012, AAMAS.

[3]  C. Martin.  2015 , 2015, Les 25 ans de l’OMC: Une rétrospective en photos.

[4]  Nicholas R. Jennings,et al.  On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be? , 2015, AAAI.

[5]  Cees Witteveen,et al.  Boolean games , 2001 .

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

[7]  Michael Wooldridge,et al.  On the logic of cooperation and propositional control , 2005, Artif. Intell..

[8]  Emiliano Lorini,et al.  Strategic Disclosure of Opinions on a Social Network: (Extended Abstract) , 2016, AAMAS.

[9]  Wojciech Jamroga,et al.  Modular interpreted systems , 2007, AAMAS '07.

[10]  Jelle Gerbrandy,et al.  Logics of propositional control , 2006, AAMAS '06.

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

[12]  Emiliano Lorini,et al.  Ceteris Paribus Structure in Logics of Game Forms , 2013, TARK.

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

[14]  M. Gribaudo,et al.  2002 , 2001, Cell and Tissue Research.

[15]  Paolo Turrini,et al.  Equilibrium Refinement through Negotiation in Binary Voting , 2014, IJCAI.

[16]  Michael Wooldridge,et al.  On the complexity of practical ATL model checking , 2006, AAMAS '06.

[17]  Kaile Su,et al.  The Complexity of Model Checking Succinct Multiagent Systems , 2015, IJCAI.

[18]  Nicholas R. Jennings,et al.  Convergence to Equilibria in Plurality Voting , 2010, AAAI.

[19]  J. Dix,et al.  Model Checking Logics of Strategic Ability: Complexity* , 2010 .

[20]  Andreas Herzig,et al.  On Logics of Strategic Ability Based on Propositional Control , 2016, IJCAI.

[21]  Michael Wooldridge,et al.  Reasoning About the Transfer of Control , 2014, J. Artif. Intell. Res..