The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games

From MaRDI portal
Publication:5056367

DOI10.1145/3517128zbMATH Open1505.03048arXiv2012.14195OpenAlexW3114442593MaRDI QIDQ5056367FDOQ5056367


Authors: Sebastian Enqvist, Valentin Goranko Edit this on Wikidata


Publication date: 8 December 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Abstract: We introduce and study a natural extension of the Alternating time temporal logic ATL, called Temporal Logic of Coalitional Goal Assignments (TLCGA). It features just one, but quite expressive, coalitional strategic operator, viz. the coalitional goal assignment operator, which is based on a mapping assigning to each set of players in the game its coalitional goal, formalised by a path formula of the language of TLCGA, i.e. a formula prefixed with a temporal operator X,U, or G, representing a temporalised objective for the respective coalition, describing the property of the plays on which that objective is satisfied. We establish fixpoint characterizations of the temporal goal assignments in a mu-calculus extension of TLCGA, discuss its expressiveness and illustrate it with some examples, prove bisimulation invariance and Hennessy-Milner property for it with respect to a suitably defined notion of bisimulation, construct a sound and complete axiomatic system for TLCGA, and obtain its decidability via finite model property.


Full work available at URL: https://arxiv.org/abs/2012.14195




Recommendations




Cites Work


Cited In (1)





This page was built for publication: The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056367)