Admissibility in Games

Adam Brandenburger, Amanda Friedenberg and H. Jerome Keisler

Econometrica, 2008, vol. 76, issue 2, pages 307-352

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 show that (i) RCAR is characterized by a solution concept we call a "self-admissible set"; (ii) in a "complete" type structure, RmAR is characterized by the set of strategies that survive m+1 rounds of elimination of inadmissible strategies; (iii) under certain conditions, RCAR is impossible in a complete structure. Copyright The Econometric Society 2008.

Date: 2008
View citations in EconPapers

Downloads: (external link)
http://hdl.handle.net/10.1111/j.0012-9682.2008.00835.x link to full text (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:ecm:emetrp:v:76:y:2008:i:2:p:307-352

Ordering information: This journal article can be ordered from
http://www.blackwell ... mb.asp?ref=0012-9682

Access Statistics for this article

Econometrica is edited by Stephen Morris

More articles in Econometrica from Econometric Society
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().