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.
Author supplied keywords
Cite
CITATION STYLE
Pauly, M. (2002). A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1), 149–166. https://doi.org/10.1093/logcom/12.1.149
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.