Proper rationalizability and backward induction
This paper introduces a new normal form rationalizability concept, which in reduced normal form games corresponding to generic finite extensive games of perfect information yields the unique backward induction outcome. The basic assumption is that every player trembles "more or less rationally" as in the definition of a -proper equilibrium by Myerson (1978). In the same way that proper equilibrium refines Nash and perfect equilibrium, our model strengthens the normal form rationalizability concepts by Bernheim (1984), BÃrgers (1994) and Pearce (1984). Common knowledge of trembling implies the iterated elimination of strategies that are strictly dominated at an information set. The elimination process starts at the end of the game tree and goes backwards to the beginning.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 28 (1999)
Issue (Month): 4 ()
|Note:||Received: October 1996/Final version: May 1999|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:28:y:1999:i:4:p:599-615. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.