2008
DOI: 10.1111/j.1468-0262.2008.00835.x
|View full text |Cite
|
Sign up to set email alerts
|

Admissibility in Games

Abstract: Suppose that each player in a game is rational, each player thinks the other players are rational, and so on. Also, suppose that rationality is taken to incorporate an admissibility requirement-that is, the avoidance of weakly dominated strategies. Which strategies can be played? We provide an epistemic framework in which to address this question. Specifically, we formulate conditions of rationality and mth-order assumption of rationality (RmAR) and rationality and common assumption of rationality (RCAR). We s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
66
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 131 publications
(66 citation statements)
references
References 29 publications
0
66
0
Order By: Relevance
“…PR is equivalent to iterated admissibility on the tree as defined by Brandenburger and Friedenberg (2007). Iterated admissibility on the tree is analogous to iterated dominance conditional on normal-form information setsà la Shimoji and Watson (1994), in which strict dominance is replaced by weak dominance.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…PR is equivalent to iterated admissibility on the tree as defined by Brandenburger and Friedenberg (2007). Iterated admissibility on the tree is analogous to iterated dominance conditional on normal-form information setsà la Shimoji and Watson (1994), in which strict dominance is replaced by weak dominance.…”
Section: Introductionmentioning
confidence: 99%
“…Iterated admissibility on the tree is analogous to iterated dominance conditional on normal-form information setsà la Shimoji and Watson (1994), in which strict dominance is replaced by weak dominance. Brandenburger and Friedenberg (2007) show that iterated admissibility on the tree is equivalent to IA of the strategic form of the game. IA does not require conditioning on normal-form information sets.…”
Section: Introductionmentioning
confidence: 99%
“…Without controlling for beliefs about the rationality and logical omniscience of others, failure to play the equilibrium cannot be interpreted as limited ability to perform iterated reasoning. 9 Consequently, a researcher interested in the ability of humans to perform chains 6 A similar observation is made in Weber (2003). 7 We refer the reader to chapter 5 of Camerer (2003) for a survey of this literature.…”
mentioning
confidence: 97%
“…7 We refer the reader to chapter 5 of Camerer (2003) for a survey of this literature. 8 Note that the solution concept of iterated deletion of weakly dominated strategies requires more stringent conditions than common knowledge of rationality (see Brandenburger et al (2008)). 9 The same is true for beauty contests where a logically omniscient player chooses the number corre-4 of iterative reasoning might underestimate the actual ability of humans when relying on choices in beauty contest or centipede games alone.…”
mentioning
confidence: 99%
See 1 more Smart Citation