[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v75y2007i2p365-400.html
   My bibliography  Save this article

A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements

Author

Listed:
  • Jonathan Weinstein
  • Muhamet Yildiz
Abstract
Rationalizability is a central solution concept of game theory. Economic models often have many rationalizable outcomes, motivating economists to use refinements of rationalizability, including equilibrium refinements. In this paper we try to achieve a general understanding of when this multiplicity occurs and how one should deal with it. Assuming that the set of possible payoff functions and belief structures is sufficiently rich, we establish a revealing structure of the correspondence of beliefs to sets of rationalizable outcomes. We show that, for any rationalizable action a of any type, we can perturb the beliefs of the type in such a way that a is uniquely rationalizable for the new type. This unique outcome will be robust to further small changes. When multiplicity occurs, then we are in a "knife-edge" case, where the unique rationalizable outcome changes, sandwiched between open sets of types where each of the rationalizable actions is uniquely rationalizable. As an immediate application of this result, we characterize, for any refinement of rationalizability, the predictions that are robust to small misspecifications of interim beliefs. These are only those predictions that are true for all rationalizable strategies, that is, the predictions that could have been made without the refinement. Copyright The Econometric Society 2007.

Suggested Citation

  • Jonathan Weinstein & Muhamet Yildiz, 2007. "A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements," Econometrica, Econometric Society, vol. 75(2), pages 365-400, March.
    • Handle: RePEc:ecm:emetrp:v:75:y:2007:i:2:p:365-400
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1468-0262.2006.00751.x
    File Function: link to full text
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:75:y:2007:i:2:p:365-400. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.