The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Modal Logic for Coalitional Power in Games
Abstract
We present a modal logic for reasoning about what groups of agents can bring about by collective action. Given a set of states, we introduce game frames which associate with every state a strategic game among the agents. Game frames are essentially extensive games of perfect information with simultaneous actions, where every action profile is associated with a new state, the outcome of the game. A coalition of players is effective for a set of states X in a game if the coalition can guarantee the outcome of the game to lie in X. We propose a modal logic (Coalition Logic) to formalize reasoning about effectivity in game frames, where [C]φ expresses that coalition C is effective for φ. An axiomatization is presented and completeness proved. Coalition Logic provides a unifying game‐theoretic view of modal logic: Since nondeterministic processes and extensive games without parallel moves emerge as particular instances of game frames, normal and non‐normal modal logics correspond to 1‐ and 2‐player versions of Coalition Logic. The satisfiability problem for Coalition Logic is shown to be PSPACE‐complete.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1994) · Cited by 5,513
Chellas, B. F. (1980) · Cited by 1,806
Harel, D., Kozen, D. C., & Tiuryn, J. (2000) · Cited by 1,439
(1992) · Cited by 691
The Computational Complexity of Provability in Systems of Modal Propositional Logic
Ladner, R. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206033 · Cited by 555
The Logic of Games and its Applications
Parikh, R. (1985) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73078-0 · Cited by 187
Coalition formation processes with belief revision among bounded-rational self-interested agents
Tohmé, F. (1999) · Journal of Logic and Computation · doi:10.1093/logcom/9.6.793 · Cited by 51
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Computational Aspects of Cooperative Game Theory
Chalkiadakis, G., Elkind, E., & Wooldridge, M. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01558-8 · Cited by 337
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
van der Hoek, W., & Wooldridge, M. (2003) · Studia Logica · doi:10.1023/a:1026185103185 · Cited by 269
(2006) · Cited by 17
Metadata
- Authors
- Pauly, M.
- Venue
- Journal of Logic and Computation
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-02-01
- Volume
- 12
- Issue
- 1
- Pages
- 149-166
- ISSN
- 0955-792X (ISSN-L)
- 1465-363X
- OpenAlex
- W2109058602
- Cited by
- 466
- References
- 7
- FWCI
- 9.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.