Skip Navigation

Journal of Logic and Computation 2002 12(1):149-166; doi:10.1093/logcom/12.1.149
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pauly, M.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?


Original Article

A Modal Logic for Coalitional Power in Games

Marc Pauly1

1 Center for Mathematics and Computer Science (CWI), P.O. Box 94079, 1090 GB Amsterdam, The Netherlands. E-mail: pauly{at}cwi.nl

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]{phi} expresses that coalition C is effective for {phi}. 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.

Keywords: Modal logic; game theory; multiagent systems


Received 2 May 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Logic Jnl IGPLHome page
T. Agotnes and M. Walicki
Complete Axiomatisations of Properties of Finite Sets
Logic Jnl IGPL, June 1, 2008; 16(3): 293 - 313.
[Abstract] [PDF]


Home page
J Logic ComputationHome page
J. Broersen, A. Herzig, and N. Troquard
Embedding Alternating-time Temporal Logic in Strategic Logic of Agency
J Logic Computation, October 1, 2006; 16(5): 559 - 578.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.