Abstract
Best-response sets (Pearce, 1984 [28]) characterize the epistemic condition of "rationality and common belief of rationality." When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger, Friedenberg, and Keisler, 2008 [17]) characterizes "rationality and common assumption of rationality." We analyze the behavior of SAS's in some games of interest-Centipede, the Finitely Repeated Prisoner's Dilemma, and Chain Store. We then establish some general properties of SAS's, including a characterization in perfect-information games.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 785-811 |
| Number of pages | 27 |
| Journal | Journal of Economic Theory |
| Volume | 145 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 2010 |
| Externally published | Yes |
Keywords
- Admissibility
- Epistemic game theory
- Iterated admissibility
- Perfect-information games
- Self-admissible sets
- Weak dominance
ASJC Scopus subject areas
- Economics and Econometrics