Decidable Model Checking with Uniform Strategies

The logic of strategic ability Resource-Bounded Alternating Time Syntactic Epistemic Logic (RB+-ATSEL) has a decidable model-checking problem for coalition uniform strategies. A strategy is coalition uniform if agents in a coalition select the same joint action in all states where the knowledge of the coalition is the same. However, this presupposes free and unbounded communication between the agents in the coalition before every action selection. In this paper we present a modified version of RB+-ATSEL, RB+-ATSELc, with explicit (and explicitly costed) communication actions. RB+-ATSELc is interpreted on communication models which have an explicit communication step before every action selection. We show that, unlike standard ATL under imperfect information, the model checking problem for RB+-ATSELc is decidable under perfect recall uniform strategies. Our decidability result also applies to ATL with imperfect information and perfect recall when interpreted on communication models.

[1]  Constantin Enea,et al.  Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions , 2010, GANDALF.

[2]  Alessio Lomuscio,et al.  Model checking knowledge, strategies, and games in multi-agent systems , 2006, AAMAS '06.

[3]  Nguyen Hoang Nga,et al.  Decidable Model-Checking for a Resource Logic with Production of Resources , 2014, ECAI.

[4]  Steen Vester.  Alternating-time temporal logic with finite-memory strategies , 2013, GandALF.

[5]  Michael Wooldridge,et al.  Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.

[6]  Wojciech Jamroga,et al.  Multi-agency Is Coordination and (Limited) Communication , 2014, PRIMA.

[7]  Thomas Ågotnes,et al.  Action and Knowledge in Alternating-Time Temporal Logic , 2006, Synthese.

[8]  Alessio Lomuscio,et al.  Verification of Multi-agent Systems with Imperfect Information and Public Actions , 2017, AAMAS.

[9]  Berndt Muller.  On the (un-)decidability of model-checking resource-bounded agents , 2010 .

[10]  Valentin Goranko,et al.  How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract) , 2013, SR.

[11]  Constantin Enea,et al.  An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking , 2011, J. Appl. Non Class. Logics.

[12]  Wojciech Jamroga,et al.  Agents that Know How to Play , 2004, Fundam. Informaticae.

[13]  Wojciech Jamroga,et al.  Constructive knowledge: what agents can achieve under imperfect information , 2007, J. Appl. Non Class. Logics.

[14]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.

[15]  Ferucio Laurentiu Tiplea,et al.  Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable , 2011, ArXiv.

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

[17]  Brian Logan,et al.  On the Complexity of Resource-Bounded Logics , 2016, RP.

[18]  Mehdi Dastani,et al.  Verifying Existence of Resource-Bounded Coalition Uniform Strategies , 2016, IJCAI.

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