IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v107y2002i2p474-482.html
   My bibliography  Save this article

Iterated Weak Dominance in Strictly Competitive Games of Perfect Information

Author

Listed:
  • Ewerhart, Christian

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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Ewerhart, Christian, 2002. "Iterated Weak Dominance in Strictly Competitive Games of Perfect Information," Journal of Economic Theory, Elsevier, vol. 107(2), pages 474-482, December.
  • Handle: RePEc:eee:jetheo:v:107:y:2002:i:2:p:474-482
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(01)92958-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Other versions of this item:

    References listed on IDEAS

    as
    1. Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-1151, November.
    2. Rosenthal, Robert W., 1981. "Games of perfect information, predatory pricing and the chain-store paradox," Journal of Economic Theory, Elsevier, vol. 25(1), pages 92-100, August.
    3. Ewerhart, Christian, 2000. "Chess-like Games Are Dominance Solvable in at Most Two Steps," Games and Economic Behavior, Elsevier, vol. 33(1), pages 41-47, October.
    4. Battigalli, Pierpaolo, 1997. "On Rationalizability in Extensive Games," Journal of Economic Theory, Elsevier, vol. 74(1), pages 40-61, May.
    5. Gretlein, Rodney, J, 1982. "Dominance Solvable Voting Schemes: A Comment," Econometrica, Econometric Society, vol. 50(2), pages 527-528, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. Osterdal, Lars Peter, 2005. "Iterated weak dominance and subgame dominance," Journal of Mathematical Economics, Elsevier, vol. 41(6), pages 637-645, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Osterdal, Lars Peter, 2005. "Iterated weak dominance and subgame dominance," Journal of Mathematical Economics, Elsevier, vol. 41(6), pages 637-645, September.
    2. Burkhard Schipper & Hee Yeul Woo, 2012. "Political Awareness and Microtargeting of Voters in Electoral Competition," Working Papers 124, University of California, Davis, Department of Economics.
    3. 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.
    4. Burkhard Schipper & Hee Yeul Woo, 2012. "Political Awareness and Microtargeting of Voters in Electoral Competition," Working Papers 46, University of California, Davis, Department of Economics.
    5. Burkhard Schipper & Hee Yeul Woo, 2014. "Political Awareness, Microtargeting of Voters, and Negative Electoral Campaigning," Working Papers 148, University of California, Davis, Department of Economics.
    6. Schipper, Burkhard C. & Woo, Hee Yeul, 2019. "Political Awareness, Microtargeting of Voters, and Negative Electoral Campaigning," Quarterly Journal of Political Science, now publishers, vol. 14(1), pages 41-88, January.
    7. Burkhard C. Schipper & Hang Zhou, 2022. "Level-k Thinking in the Extensive Form," Working Papers 352, University of California, Davis, Department of Economics.
    8. Geir B. Asheim & Martin Dufwenberg, 2003. "Deductive Reasoning in Extensive Games," Economic Journal, Royal Economic Society, vol. 113(487), pages 305-325, April.
    9. Battigalli, Pierpaolo, 1997. "On Rationalizability in Extensive Games," Journal of Economic Theory, Elsevier, vol. 74(1), pages 40-61, May.
    10. Battigalli, Pierpaolo & Siniscalchi, Marciano, 1999. "Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games," Journal of Economic Theory, Elsevier, vol. 88(1), pages 188-230, September.
    11. Asheim, Geir B., 2002. "On the epistemic foundation for backward induction," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 121-144, November.
    12. Salvador Barberà & Anke Gerber, 2015. "Sequential Voting and Agenda Manipulation: The Case of Forward Looking Tie-Breaking," Working Papers 782, Barcelona School of Economics.
    13. Rich, Patricia, 2015. "Rethinking common belief, revision, and backward induction," Mathematical Social Sciences, Elsevier, vol. 75(C), pages 102-114.
    14. Licun Xue, "undated". "A Notion of Consistent Rationalizability - Between Weak and Pearce's Extensive Form Rationalizability," Economics Working Papers 2000-4, Department of Economics and Business Economics, Aarhus University.
    15. Christopher Tyson, 2010. "Dominance solvability of dynamic bargaining games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(3), pages 457-477, June.
    16. Patrick Hummel, 2008. "Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(2), pages 257-269, August.
    17. Françoise Forges & József Sákovics, 2022. "Tenable threats when Nash equilibrium is the norm," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(3), pages 589-605, November.
    18. Ewerhart, Christian, 2000. "Chess-like Games Are Dominance Solvable in at Most Two Steps," Games and Economic Behavior, Elsevier, vol. 33(1), pages 41-47, October.
    19. Zuazo-Garin, Peio, 2017. "Uncertain information structures and backward induction," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 135-151.
    20. Ponti, Giovanni, 2000. "Cycles of Learning in the Centipede Game," Games and Economic Behavior, Elsevier, vol. 30(1), pages 115-141, January.

    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:eee:jetheo:v:107:y:2002:i:2:p:474-482. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    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.