This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Proper rationalizability and backward induction

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Frank Schuhmacher () (Betriebswirtschaftliche Abteilung I, University of Bonn, Adenauerallee 24-42, D-53113 Bonn, Germany)
Abstract

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://link.springer.de/link/service/journals/00182/papers/9028004/90280599.pdf
File Format: application/pdf
File Function:
Download Restriction: Access to the full text of the articles in this series is restricted

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.

Publisher Info
Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 28 (1999)
Issue (Month): 4 ()
Pages: 599-615
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:spr:jogath:v:28:y:1999:i:4:p:599-615

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

For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).

Related research
Keywords: Rationalizability · backward induction · normal form;

Cited by:
(explanations, 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.)

  1. Antonio Quesada, 2002. "Belief system foundations of backward induction," Theory and Decision, Springer, vol. 53(4), pages 393-403, December. [Downloadable!] (restricted)
  2. Perea,Andrés, 2003. "Proper Rationalizability and Belief Revision in Dynamic Games," Research Memoranda 048, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization. [Downloadable!]
  3. Perea,Andrés, 2003. "Rationalizability and Minimal Complexity in Dynamic Games," Research Memoranda 047, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization. [Downloadable!]
Statistics
Access and download statistics

Did you know? You can use convenient plug-ins to search directly IDEAS from your browser.

This page was last updated on 2009-10-18.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.