MoL-2003-05: A Model for Epistemic Games

MoL-2003-05: Hötte, Tanja (2003) A Model for Epistemic Games. [Report]

[thumbnail of Full Text (PDF)]
Text (Full Text (PDF))

Download (447kB) | Preview
[thumbnail of Full Text (PS)] Text (Full Text (PS))

Download (295kB)
[thumbnail of Abstract] Text (Abstract)

Download (1kB)


In this thesis, I introduce and investigate a new framework for modeling epistemic information in games that allows to express more general types of uncertainty than, for instance, imperfect information. In particular, we liberate the view on epistemic alternatives: not just other states of the same tree are considered, but completely independent other game trees. In doing this, we open a wider perspective on modeling games in epistemic logic, beyond existing work on standard imperfect information games.

We give a basic language and a minimal logic for epistemic game models and proved completeness. Furthermore we discuss several other modal formulas one might take as axioms for special subclasses of epistemic game models, such as almost bending back. By extending the language with inverse action relations and some iteration operators, we increase its expressiveness, e.g. it now becomes possible to define the property of being a single tree model by a modal formula. In comparing our static approach to the dynamic update systems of Baltag, Moss and Solecki we find several means of extending their account to include the treatment of games.

Item Type: Report
Report Nr: MoL-2003-05
Series Name: Master of Logic Thesis (MoL) Series
Year: 2003
Uncontrolled Keywords: epistemic games, uncertainty, dynamic update systems
Date Deposited: 12 Oct 2016 14:38
Last Modified: 12 Oct 2016 14:38

Actions (login required)

View Item View Item