IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v70y2002i5p2007-2023.html
   My bibliography  Save this article

Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance

Author

Listed:
  • Martin Dufwenberg

    (Stockholm University, Sweden)

  • Mark Stegeman

    (Virginia Polytechnic Institute, U.S.A.)

Abstract

Iterated elimination of strictly dominated strategies is an order dependent procedure. It can also generate spurious Nash equilibria, fail to converge in countable steps, or converge to empty strategy sets. If best replies are well-defined, then spurious Nash equilibria cannot appear; if strategy spaces are compact and payoff functions are uppersemicontinuous in own strategies, then order does not matter; if strategy sets are compact and payoff functions are continuous in all strategies, then a unique and nonempty maximal reduction exists. These positive results extend neither to the better-reply secure games for which Reny has established the existence of a Nash equilibrium, nor to games in which (under iterated eliminations) any dominated strategy has an undominated dominator. Copyright The Econometric Society 2002.

Suggested Citation

  • Martin Dufwenberg & Mark Stegeman, 2002. "Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance," Econometrica, Econometric Society, vol. 70(5), pages 2007-2023, September.
    • Handle: RePEc:ecm:emetrp:v:70:y:2002:i:5:p:2007-2023
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:70:y:2002:i:5:p:2007-2023. 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.