Next Article in Journal
Trust with Private and Common Property: Effects of Stronger Property Right Entitlements
Next Article in Special Issue
Toward a Theory of Play: A Logical Perspective on Games and Interaction
Previous Article in Journal
Inequality Aversion and Reciprocity in Moonlighting Games
Previous Article in Special Issue
Consistent Beliefs in Extensive Form Games

A Modal Logic of Epistemic Games

IRIT-CNRS, Université de Toulouse, 118 route de Narbonne, 31062 Toulouse, France
Authors to whom correspondence should be addressed.
Games 2010, 1(4), 478-526;
Received: 11 June 2010 / Revised: 7 September 2010 / Accepted: 22 October 2010 / Published: 2 November 2010
(This article belongs to the Special Issue Epistemic Game Theory and Modal Logic)
We propose some variants of a multi-modal of joint action, preference and knowledge that support reasoning about epistemic games in strategic form. The first part of the paper deals with games with complete information. We first provide syntactic proofs of some well-known theorems in the area of interactive epistemology that specify some sufficient epistemic conditions of equilibrium notions such as Nash equilibrium and Iterated Deletion of Strictly Dominated Strategies (IDSDS). Then, we present a variant of the logic extended with dynamic operators of Dynamic Epistemic Logic (DEL). We show that it allows to express the notion IDSDS in a more compact way. The second part of the paper deals with games with weaker forms of complete information. We first discuss several assumptions on different aspects of perfect information about the game structure (e.g., the assumption that a player has perfect knowledge about the players’ strategy sets or about the preference orderings over strategy profiles), and show that every assumption is expressed by a corresponding logical axiom of our logic. Then we provide a proof of Harsanyi’s claim that all uncertainty about the structure of a game can be reduced to uncertainty about payoffs. Sound and complete axiomatizations of the logics are given, as well as some complexity results for the satisfiability problem. View Full-Text
Keywords: game theory; modal logic; dynamic epistemic logic game theory; modal logic; dynamic epistemic logic
Show Figures

Graphical abstract

MDPI and ACS Style

Lorini, E.; Schwarzentruber, F. A Modal Logic of Epistemic Games. Games 2010, 1, 478-526.

AMA Style

Lorini E, Schwarzentruber F. A Modal Logic of Epistemic Games. Games. 2010; 1(4):478-526.

Chicago/Turabian Style

Lorini, Emiliano, and François Schwarzentruber. 2010. "A Modal Logic of Epistemic Games" Games 1, no. 4: 478-526.

Find Other Styles

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop