Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
The temporal logic of coalitional goal assignments in concurrent multiplayer games
Enqvist S., Goranko V. ACM Transactions on Computational Logic23 (4):1-58,2022.Type:Article
Date Reviewed: Jun 25 2024

Enqvist and Goranko’s temporal logic of coalitional goal assignments (TL-CGA) extends Alur, Henzinger, and Kupferman’s 1997 alternating-time temporal logic (ATL) and de Pauly’s 2002 coalition logic (CL). TL-CGA is used in multi-agent environments (MAS) and artificial intelligence (AI) to model complex interactions and objectives between agents. This paper focuses on the formalization of CGA, reasoning about coalitions and the development of tools and logical operators for this purpose.

The first extension, that is, TLCGA+, allows for modeling and reasoning about the “sheep and wolves” example. The authors use the concept of Nash equilibria (NE) to analyze the behavior of agents, such as animals facing each other’s challenges within coalitions based on their objectives and strategies. While NE are used to analyze strategic interactions, it is important to note that, typically, animal behavior is not explicitly guided by NE or formal game theory. Instead, animal behavior is often a result of evolutionary pressures and adaptations to their environments.

The second extension, LXCGAμ, which is a logical coalgebraic fixed-point operator in the style of modal µ-calculus, allows reasoning about coalgebraic systems with temporal and fixed-point properties. Applying the extended closure (Fischer-Ladner) TLCGA formula allows for the construction of a modular system, where each module functions with its own well-defined functionality, simplifying system design and maintenance.

Understanding the coalgebraic languages LTLCGA and LXCGAμ is crucial for effectively working with finite action models. These languages are the core of the research and enable reasoning about temporal and coalitional properties.

Reviewer:  Romina Fucà Review #: CR147783
Bookmark and Share
  Featured Reviewer  
Games (K.8.0 ... )
Deduction And Theorem Proving (I.2.3 )
Mathematical Logic (F.4.1 )
Would you recommend this review?
Other reviews under "Games": Date
How to beat your chess computer
Keene R., Levy D. (ed), Henry Holt, New York, NY, 1992. Type: Book (9780805023169)
Jun 1 1994
Relationships between fun and the computer business
Bushnell N. Communications of the ACM 39(9): 31-37, 1996. Type: Article
Apr 1 1997
NetWarriors online
Gradecki J., John Wiley & Sons, Inc., New York, NY, 1996. Type: Book (9780471135555)
Jul 1 1997

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy