A logical characterization of iterated admissibility

Joseph Y. Halpern, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 characterization of iterated admissibility is given that involves only standard probability and holds in all structures, not just complete structures. Roughly speaking, our characterization shows that iterated admissibility captures the intuition that "all the agent knows" is that agents satisfy the appropriate rationality assumptions.

Original languageEnglish
Title of host publicationProceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09
Pages146-155
Number of pages10
DOIs
StatePublished - 2009
Externally publishedYes
Event12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09 - Pacific Grove, CA, United States
Duration: 6 Jul 20098 Jul 2009

Publication series

NameProceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09

Conference

Conference12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09
Country/TerritoryUnited States
CityPacific Grove, CA
Period6/07/098/07/09

Fingerprint

Dive into the research topics of 'A logical characterization of iterated admissibility'. Together they form a unique fingerprint.

Cite this