Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 466

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

Pauly, M. · 2002 · Journal of Logic and Computation

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/logcom/12.1.149

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 466

Metadata

Authors
Pauly, M.
Venue
Journal of Logic and Computation
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.