The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
From MaRDI portal
Publication:5056367
DOI10.1145/3517128zbMATH Open1505.03048OpenAlexW3114442593MaRDI QIDQ5056367FDOQ5056367
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.
Recommendations
Cites Work
- scientific article; zbMATH DE number 1600673 (Why is no real title available?)
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 3880483 (Why is no real title available?)
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A Modal Logic for Coalitional Power in Games
- A course in game theory.
- ATL with Strategy Contexts and Bounded Memory
- Alternating-time temporal logic
- Automata and fixed point logic: a coalgebraic perspective
- Automata for coalgebras: an approach using predicate liftings
- Coalgebraic logic
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Complete axiomatization and decidability of alternating-time temporal logic
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Completeness for flat modal fixpoint logics
- Computational Aspects of Cooperative Game Theory
- Dependences in strategy logic
- Distributed computing meets game theory
- EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
- Expressivity of coalgebraic modal logic: the limits and beyond
- Flat modal fixpoint logics with the converse modality
- Graded modalities in strategy logic
- Logics for Reasoning About Strategic Abilities in Multi-player Games
- Models in Cooperative Game Theory
- Modular construction of complete coalgebraic logics
- On the boundary of behavioral strategies
- On the logic of ability
- On the logic of cooperation and propositional control
- PSPACE bounds for rank-1 modal logics
- Rational synthesis
- Reasoning about strategies
- Reasoning about strategies: on the model-checking problem
- Reasoning about strategies: on the satisfiability problem
- Strategy logic
- Temporal logics in computer science. Finite-state systems
- Towards a logic for conditional local strategic reasoning
- Universal coalgebra: A theory of systems
Cited In (4)
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)
