DeepAI AI Chat
Log In Sign Up

A Logical Characterization of Iterated Admissibility

by   Joseph Y. Halpern, et al.

Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called a complete structure, where all types are possible. Here, a logical charaacterization of iterated admisibility is given that involves only standard probability and holds in all structures, not just complete structures. A stronger notion of strong admissibility is then defined. Roughly speaking, strong admissibility is meant to capture the intuition that "all the agent knows" is that the other agents satisfy the appropriate rationality assumptions. Strong admissibility makes it possible to relate admissibility, canonical structures (as typically considered in completeness proofs in modal logic), complete structures, and the notion of "all I know".


page 1

page 2

page 3

page 4


A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...

Strategic Coalitions in Stochastic Games

The article introduces a notion of a stochastic game with failure states...

The Relationship between Knowledge, Belief and Certainty

We consider the relation between knowledge and certainty, where a fact i...

A logical theory for strong and weak ontic necessities in branching time

Ontic necessities are those modalities universally quantifying over doma...

Logics for Epistemic Actions: Completeness, Decidability, Expressivity

We consider dynamic versions of epistemic logic as formulated in Baltag ...

Weighted regret-based likelihood: a new approach to describing uncertainty

Recently, Halpern and Leung suggested representing uncertainty by a weig...

Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes

An indiscernible sequence (a̅_i)_1≤ i≤ n in a structure is an ordered se...