IDEAS home Printed from https://ideas.repec.org/p/xrs/sfbmaa/00-24.html
   My bibliography  Save this paper

Chess-like games are dominancesolvable in at most two steps

Author

Listed:
  • Ewerhart, Christian

    (Deutsche Börse AG)

Abstract

We show that strictly competitive, finite games of perfect information that may end in one of three possible ways can be solved by applying only two rounds of elimination of dominated strategies.

Suggested Citation

  • Ewerhart, Christian, 2000. "Chess-like games are dominancesolvable in at most two steps," Sonderforschungsbereich 504 Publications 00-24, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    • Handle: RePEc:xrs:sfbmaa:00-24
    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.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Christian Ewerhart, 1998. "Rationality and the definition of consistent pairs," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(1), pages 49-59.
    2. Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-1151, November.
    3. Borgers, Tilman, 1993. "Pure Strategy Dominance," Econometrica, Econometric Society, vol. 61(2), pages 423-430, March.
    4. Balkenborg, Dieter & Winter, Eyal, 1997. "A necessary and sufficient epistemic condition for playing backward induction," Journal of Mathematical Economics, Elsevier, vol. 27(3), pages 325-345, April.
    5. Gul, Faruk, 1996. "Rationality and Coherent Theories of Strategic Behavior," Journal of Economic Theory, Elsevier, vol. 70(1), pages 1-31, July.
    6. Samuelson, Larry, 1992. "Dominated strategies and common knowledge," Games and Economic Behavior, Elsevier, vol. 4(2), pages 284-313, April.
    7. Aumann, Robert J., 1995. "Backward induction and common knowledge of rationality," Games and Economic Behavior, Elsevier, vol. 8(1), pages 6-19.
    8. 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. Ewerhart, Christian, 2002. "Backward Induction and the Game-Theoretic Analysis of Chess," Games and Economic Behavior, Elsevier, vol. 39(2), pages 206-214, May.
    2. 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.
    3. V. P. Crawford, 2014. "Boundedly rational versus optimization-based models of strategic thinking and learning in games," Voprosy Ekonomiki, NP Voprosy Ekonomiki, issue 5.
    4. Eli Ben-Sasson & Adam Tauman Kalai & Ehud Kalai, 2006. "An Approach to Bounded Rationality," Discussion Papers 1439, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    5. Dufwenberg, Martin & Sundaram, Ramya & Butler, David J., 2010. "Epiphany in the Game of 21," Journal of Economic Behavior & Organization, Elsevier, vol. 75(2), pages 132-143, August.
    6. 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.
    7. Osterdal, Lars Peter, 2005. "Iterated weak dominance and subgame dominance," Journal of Mathematical Economics, Elsevier, vol. 41(6), pages 637-645, September.
    8. Matros, Alexander, 2018. "Lloyd Shapley and chess with imperfect information," Games and Economic Behavior, Elsevier, vol. 108(C), pages 600-613.
    9. Subhasish Dugar & Haimanti Bhattacharya, 2008. "The Power of Reasoning: Experimental Evidence," Working Paper Series, Department of Economics, University of Utah 2008_20, University of Utah, Department of Economics.

    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. Dekel, Eddie & Siniscalchi, Marciano, 2015. "Epistemic Game Theory," Handbook of Game Theory with Economic Applications,, Elsevier.
    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. Battigalli, Pierpaolo & Bonanno, Giacomo, 1999. "Recent results on belief, knowledge and the epistemic foundations of game theory," Research in Economics, Elsevier, vol. 53(2), pages 149-225, June.
    4. Xiao Luo & Yi-Chun Chen, 2004. "A Unified Approach to Information, Knowledge, and Stability," Econometric Society 2004 Far Eastern Meetings 472, Econometric Society.
    5. Chen, Yi-Chun & Long, Ngo Van & Luo, Xiao, 2007. "Iterated strict dominance in general games," Games and Economic Behavior, Elsevier, vol. 61(2), pages 299-315, November.
    6. Xiao Luo, 2009. "On the foundation of stability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(2), pages 185-201, August.
    7. 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.
    8. Asheim, G.B. & Dufwenberg, M., 1996. "Admissibility and Common Knowledge," Discussion Paper 1996-16, Tilburg University, Center for Economic Research.
    9. Asheim, Geir B. & Dufwenberg, Martin, 2003. "Admissibility and common belief," Games and Economic Behavior, Elsevier, vol. 42(2), pages 208-234, February.
    10. Asheim, Geir B., 2002. "On the epistemic foundation for backward induction," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 121-144, November.
    11. Bonanno, Giacomo, 2013. "A dynamic epistemic characterization of backward induction without counterfactuals," Games and Economic Behavior, Elsevier, vol. 78(C), pages 31-43.
    12. Xiao Luo & Xuewen Qian & Chen Qu, 2020. "Iterated elimination procedures," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 437-465, September.
    13. 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.
    14. Heifetz, Aviad & Meier, Martin & Schipper, Burkhard C., 2019. "Comprehensive rationalizability," Games and Economic Behavior, Elsevier, vol. 116(C), pages 185-202.
    15. Osterdal, Lars Peter, 2005. "Iterated weak dominance and subgame dominance," Journal of Mathematical Economics, Elsevier, vol. 41(6), pages 637-645, September.
    16. Geir B. Asheim & Martin Dufwenberg, 2003. "Deductive Reasoning in Extensive Games," Economic Journal, Royal Economic Society, vol. 113(487), pages 305-325, April.
    17. Takashi Kunimoto, 2006. "The Robustness Of Equilibrium Analysis: The Case Of Undominated Nash Equilibrium," Departmental Working Papers 2006-26, McGill University, Department of Economics.
    18. Ziegler, Gabriel & Zuazo-Garin, Peio, 2020. "Strategic cautiousness as an expression of robustness to ambiguity," Games and Economic Behavior, Elsevier, vol. 119(C), pages 197-215.
    19. Kamecke, Ulrich, 2001. "Dominance solvable English matching auctions," Mathematical Social Sciences, Elsevier, vol. 42(3), pages 253-269, November.
    20. Battigalli, Pierpaolo, 1997. "On Rationalizability in Extensive Games," Journal of Economic Theory, Elsevier, vol. 74(1), pages 40-61, May.

    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:00-24. 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: Carsten Schmidt (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.