Representation Theorems for Actual Powers over Two-Agent General Concurrent Game Frames
Zixuan Chen, Fengkui Ju, Thomas Ågotnes
Abstract
One of the most well-known connections between logic and games is Pauly's representation theorem: the induced powers of individuals and coalitions in concurrent game frames correspond, in a precise sense, to a certain class of neighborhood frames. The precise sense here is what is called alpha effectivity (or alpha power): the power of a coalition is characterized by the sets of states in which it can ensure that the outcome lies by taking some joint action. This definition is inherently monotonic, and, as pointed out by van Benthem, Bezhanishvili, and Enqvist (2019), that fact can obscure relevant information about the power structure in the game: we do not know whether two sets that a coalition has the power to enforce correspond to the same joint action or to different joint actions. An alternative is to characterize the power of a coalition by its actual power (called basic power by van Benthem, Bezhanishvili, and Enqvist (2019)): the collection of sets of states, each of which corresponds to one joint action by the coalition and all possible joint actions by the other agents. It has recently been argued by Li and Ju (2025, 2026) that standard concurrent game frames rely on three assumptions that may, in some cases, be too strong: seriality, independence of agents, and determinism. This yields a total of eight different classes of general concurrent game frames. In this paper, assuming two agents, we prove that, in terms of actual powers, the eight classes of general concurrent game frames are represented by eight corresponding classes of neighborhood frames. This generalizes a result by van Benthem, Bezhanishvili, and Enqvist (2019).
Create a lesson
Related papers
Some complete ω-powers of a one-counter language in the difference hierarchy
Jacques Duparc, Olivier Finkel, Dominique Lecomte
Towards Finite Satisfiability of PDL with Loops
Bartosz Jan Bednarczyk, Mikołaj Swoboda
Vision-Predictor-Action: Towards Efficient Embodied AI via Neuro-Symbolic JEPA Predictors
Yeonseok Lee
Capturing Bisimulation-Invariant Exponential-Space Complexity Classes
Florian Bruse, David Kronenberger, Martin Lange
StructHCP: Structure-Aware SAT--CEGAR for the Hamiltonian Cycle Problem
Quan Van Vi, Tuyen Van Kieu, Khanh Van To
Solving Distributed Flexible Job Shop Scheduling Problem Using SAT
Phuong Dang Anh, Duc Nguyen Kim Trung, To Van Khanh