Some Non-Classical Approaches to the Branderburger-Keisler Paradox

@article{Baskent2015SomeNA,
  title={Some Non-Classical Approaches to the Branderburger-Keisler Paradox},
  author={Can Baskent},
  journal={ArXiv},
  year={2015},
  volume={abs/1107.4929}
}
In this article, we discuss a well-known self-referential paradox in epistemic game theory, the Brandenburger-Keisler paradox. We approach the paradox from two different perspectives, non-well-founded set theory and paraconsistent logic, and provide models in which the paradox is solved. 
A Yabloesque paradox in epistemic game theory
TLDR
A Yabloesque, non-self-referential paradox for infinitary players within the context of epistemic game theory is given and a paraconsistent model satisfying the paradoxical statement is constructed.
A Non-Self-Referential Paradox in Epistemic Game Theory
TLDR
This paper presents a non-self-referential paradox in epistemic game theory which shows that completely modeling players' epistemic beliefs and assumptions is impossible and introduces an interactive temporal assumption logic to give an appropriate formalization of the new paradox.
Paraconsistent Topologies for Games Can Başkent
Topological semantics appears to be the first semantics suggested for modal logic in 1938 by Tsao-Chen [9]. Picking up from Tsao-Chen’s work, McKinsey (later with Tarski) incorporated various other
A Coalgebraic Framework for Games in Economics
TLDR
The fundamental notion of a process as a coalgebra of a certain kind is introduced and it is shown how to use them to describe stage games, finitely, infinitely and potentially infinitely repeated games with imperfect and incomplete information based on deterministic, non-deterministic or probabilistic processes.

References

SHOWING 1-10 OF 79 REFERENCES
From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference
TLDR
The Brandenburger–Keisler paradox in epistemic game theory is analyzed, which is a ‘two-person version of Russell's paradox’, and a general coalgebraic approach to the construction of assumption-complete models is outlined.
A universal approach to self-referential paradoxes, incompleteness and fixed points
TLDR
This work shows how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.
Understanding the Brandenburger-Keisler Paradox
TLDR
This paper shows that the paradox can be seen as a theorem of an appropriate hybrid logic, and study this paradox from the point of view of a modal logician.
Understanding the Brandenburger-Keisler Belief Paradox
Adam Brandenburger and H. Jerome Keisler have recently discovered a two person Russell-style paradox. They show that the following configurations of beliefs is impossible: Ann believes that Bob
An Impossibility Theorem on Beliefs in Games
TLDR
A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell's Paradox and connections are made to some questions in the foundations of game theory.
A Note on Assumption-Completeness in Modal Logic
TLDR
It is shown that there are assumption-complete models for the basic modal language (Theorem 8) and the notion of assumption-completeness, which is a property of belief models first introduced in [18], is studied.
Topological Separation Principles And Logical Theories
TLDR
The interaction between the properties of topological spaces, particularly separation properties, and logical theories on thosespaces is studied, and Necessary and sufficient conditions which relate the T1-property to theproperties of logical theories, are obtained.
Non-well-founded-Type Spaces
In a Harsanyi-types space, states become circular, self-referring objects if one tries to make the types an explicit part of the states' structure. To make such a definition rigorous, we suggest the
Independence-Friendly Logic - a Game-Theoretic Approach
TLDR
This chapter explains the development of Independence-friendly (IF) logic and some of the properties of IF logic that make it attractive as a model for probabilistic logic.
Bi-Heyting algebras, toposes and modalities
TLDR
A new approach to the modal operators of necessity and possibility is introduced, based on the existence of two negations in certain lattices that the authors call bi-Heyting algebras, by iterating certain combinations of these negations and going to the limit.
...
...