© 2019 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org) Ail rights reserved. In rational verification, one is interested in understanding which temporal logic properties will hold in a concurrent game, under the assumption that players choose strategies that form an equilibrium Players are assumed to behave rationally in pursuit of individual goals, typically specified as temporal logic formulae To date, rational verification has only been studied in noncooperative settings In this paper, we extend the rational verification framework to cooper-ative games, in which players may form coalitions to collectively achieve their goals We base our study on the computational model given by concurrent game structures and focus on the core as our basic solution concept We show the core of a concurrent game can be logically characterised using ATL, and study the computational complexity of key decision problems associated with the core, which range from problems in PSPACE to problems in 3EXPT1ME We also discuss a number of variants of the main definition of the core, leading to the issue of credible coalition formations, and a possible implementation of the main reasoning framework.
|Number of pages||9|
|Journal||Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS|
|State||Published - 1 Jan 2019|