Refining and Delegating Strategic Ability in ATL
Abstract
We propose extending Alternatingtime Temporal Logic (ATL) by an operator <i refinesto G> F to express that agent i can distribute its powers to a set of subagents G in a way which satisfies ATL condition f on the strategic ability of the coalitions they may form, possibly together with others agents. We prove the decidability of modelchecking of formulas whose subformulas with this operator as the main connective have the form <i_1 refinesto G_1>...<i_m refinesto G_m> f, with no further occurrences of this operator in f.
 Publication:

arXiv eprints
 Pub Date:
 April 2014
 DOI:
 10.48550/arXiv.1404.0840
 arXiv:
 arXiv:1404.0840
 Bibcode:
 2014arXiv1404.0840G
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Computer Science and Game Theory;
 Computer Science  Multiagent Systems
 EPrint:
 In Proceedings SR 2014, arXiv:1404.0414