IDEAS home Printed from https://ideas.repec.org/p/xrs/sfbmaa/01-33.html

Iterated Weak Dominance in Strictly Competitive Games of Perfect Information

Author

Listed:
  • Ewerhart II, Christian

    (Sonderforschungsbereich 504)

Abstract

We prove that any strictly competitive perfect-information two-person game with n outcomes is solvable in n-1 steps of elimination of weakly dominated strategies - regardless of the length of the game tree. The derivation is based on the fact that if player i does not possess a winning strategy, then any of player j's strategies that enables i to win is eliminated by two steps of iterated dominance. The given bound is shown to be tight using a variant of Rosenthal's centipede game.

Suggested Citation

  • Ewerhart II, Christian, 2001. "Iterated Weak Dominance in Strictly Competitive Games of Perfect Information," Sonderforschungsbereich 504 Publications 01-33, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    • Handle: RePEc:xrs:sfbmaa:01-33
    Note: Financial support from the Deutsche Forschungsgemeinschaft, SFB 504, at the University of Mannheim, is gratefully acknowledged.
    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
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. Bo Chen & Rajat Deb, 2018. "The role of aggregate information in a binary threshold game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(3), pages 381-414, October.
    3. Osterdal, Lars Peter, 2005. "Iterated weak dominance and subgame dominance," Journal of Mathematical Economics, Elsevier, vol. 41(6), pages 637-645, September.

    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:xrs:sfbmaa:01-33. 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: Carsten Schmidt The email address of this maintainer does not seem to be valid anymore. Please ask Carsten Schmidt to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/sfmande.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.