Common assumption of rationality
In this paper, we provide an epistemic characterization of iterated admissibility (IA), i.e., iterated elimination of weakly dominated strategies. We show that rationality and common assumption of rationality (RCAR) in complete lexicographic type structures implies IA, and that there exist such structures in which RCAR can be satisfied. Our result is unexpected in light of a negative result in Brandenburger, Friedenberg, and Keisler (2008) (BFK) that shows the impossibility of RCAR in complete continuous structures. We also show that every complete structure with RCAR has the same types and beliefs as some complete continuous structure. This enables us to reconcile and interpret the difference between our results and BFK’s. Finally, we extend BFK’s framework to obtain a single structure that contains a complete structure with an RCAR state for every game. This gives a game-independent epistemic condition for IA.
|Date of creation:||08 Sep 2011|
|Date of revision:|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- D. B. Bernheim, 2010.
"Rationalizable Strategic Behavior,"
Levine's Working Paper Archive
661465000000000381, David K. Levine.
- Adam Brandenburger & Eddie Dekel, 2014.
"Rationalizability and Correlated Equilibria,"
World Scientific Book Chapters,
in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 3, pages 43-57
World Scientific Publishing Co. Pte. Ltd..
- repec:stn:sotoec:0915 is not listed on IDEAS
- Pearce, David G, 1984. "Rationalizable Strategic Behavior and the Problem of Perfection," Econometrica, Econometric Society, vol. 52(4), pages 1029-50, July.
- Blume, Lawrence & Brandenburger, Adam & Dekel, Eddie, 1991.
"Lexicographic Probabilities and Choice under Uncertainty,"
Econometric Society, vol. 59(1), pages 61-79, January.
- Lawrence Blume & Adam Brandenburger & Eddie Dekel, 2014. "Lexicographic Probabilities and Choice Under Uncertainty," World Scientific Book Chapters, in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 6, pages 137-160 World Scientific Publishing Co. Pte. Ltd..
- Stahl, Dale O., 1995. "Lexicographic rationalizability and iterated admissibility," Economics Letters, Elsevier, vol. 47(2), pages 155-159, February.
- Monderer, Dov & Samet, Dov, 1989. "Approximating common knowledge with common beliefs," Games and Economic Behavior, Elsevier, vol. 1(2), pages 170-190, June.
- Samuelson, Larry, 1992. "Dominated strategies and common knowledge," Games and Economic Behavior, Elsevier, vol. 4(2), pages 284-313, April.
- Adam Brandenburger & Amanda Friedenberg & H. Jerome Keisler, 2008.
"Admissibility in Games,"
Econometric Society, vol. 76(2), pages 307-352, 03.
- Paulo Barelli & Spyros Galanis, 2011.
"Admissibility and Event-Rationality,"
RCER Working Papers
568, University of Rochester - Center for Economic Research (RCER).
- Battigalli, Pierpaolo, 1996. "Strategic Rationality Orderings and the Best Rationalization Principle," Games and Economic Behavior, Elsevier, vol. 13(2), pages 178-200, April.
- Blume, Lawrence & Brandenburger, Adam & Dekel, Eddie, 1991. "Lexicographic Probabilities and Equilibrium Refinements," Econometrica, Econometric Society, vol. 59(1), pages 81-98, January.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:34441. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.