A minimal coalition logic
Abstract Coalition logic is an important logic in the logical studies of strategic reasoning, whose models are concurrent game models. In this paper, we first systematically discuss three assumptions of concurrent game models and argue that they are too strong. The first is seriality, i.e. every coalition always has an available joint action. The second is the independence of agents, i.e. the merge of two available joint actions of two disjoint coalitions is always an available joint action of the union of the two coalitions. The third is determinism, i.e. all available joint actions of the grand coalition always have a unique outcome. Second, we present a coalition logic based on general concurrent game models that do not have the three assumptions and show its completeness. This logic seems minimal for reasoning about coalitional powers.
Authors
- Fengkui Ju (ORCID: https://orcid.org/0000-0002-6686-2557)
- Yinfeng Li
Institutions
- Centre National de la Recherche Scientifique (FR)
- Université Toulouse III - Paul Sabatier (FR)
- Beijing Normal University (CN)
- Université Toulouse-I-Capitole (FR)
- Institut de Recherche en Informatique de Toulouse (FR)
- Université Toulouse - Jean Jaurès (FR)
- Institut Polytechnique de Bordeaux (FR)
Publication Details
- Journal
- Journal of Logic and Computation
- Published
- 2025-11-04
- DOI
- https://doi.org/10.1093/logcom/exaf059
- Citations
- 2
- Primary Topic
- Game Theory and Voting Systems
- Type
- article
- Field-Weighted Citation Impact
- 6.26