Decidable Model Checking with Uniform Strategies

Publication date

2019

Authors

Alechina, NatashaORCID 0000-0003-3306-9891ISNI 0000000124421545
Dastani, MehdiISNI 0000000043464658
Logan, Brian

Editors

Advisors

Supervisors

DOI

Document Type

Part of book
Open Access logo

License

taverne

Abstract

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

Keywords

Taverne

Citation

Alechina, N, Dastani, M & Logan, B 2019, Decidable Model Checking with Uniform Strategies. in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019. pp. 170-178. < http://dl.acm.org/citation.cfm?id=3331690 >