Computer Science – Artificial Intelligence
Scientific paper
2009-06-23
Computer Science
Artificial Intelligence
In Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 146-155
Scientific paper
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''.
Halpern Joseph Y.
Pass Rafael
No associations
LandOfFree
A Logical Characterization of Iterated Admissibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Logical Characterization of Iterated Admissibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Logical Characterization of Iterated Admissibility will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708687