Chess-like Games Are Dominance Solvable in at Most Two Steps
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 33 (2000)
Issue (Month): 1 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Other versions of this item:
- 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.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aumann, Robert J., 1995. "Backward induction and common knowledge of rationality," Games and Economic Behavior, Elsevier, vol. 8(1), pages 6-19.
- Borgers, Tilman, 1993. "Pure Strategy Dominance," Econometrica, Econometric Society, vol. 61(2), pages 423-30, March.
- Samuelson, Larry, 1992. "Dominated strategies and common knowledge," Games and Economic Behavior, Elsevier, vol. 4(2), pages 284-313, April.
- 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.
- Balkenborg, Dieter & Eyal Winter, 1995. "A Necessary and Sufficient Epistemic Condition for Playing Backward Induction," Discussion Paper Serie B 331, University of Bonn, Germany.
- Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-51, November.
- Christian Ewerhart, 1998. "Rationality and the definition of consistent pairs," International Journal of Game Theory, Springer, vol. 27(1), pages 49-59.
- Gretlein, Rodney, J, 1982. "Dominance Solvable Voting Schemes: A Comment," Econometrica, Econometric Society, vol. 50(2), pages 527-28, March.
- Gul, Faruk, 1996. "Rationality and Coherent Theories of Strategic Behavior," Journal of Economic Theory, Elsevier, vol. 70(1), pages 1-31, July.
- V. P. Crawford., 2014.
"Boundedly Rational versus Optimization-Based Models of Strategic Thinking and Learning in Games,"
N.P. Redaktsiya zhurnala "Voprosy Economiki", vol. 5.
- Vincent P. Crawford, 2013. "Boundedly Rational versus Optimization-Based Models of Strategic Thinking and Learning in Games," Journal of Economic Literature, American Economic Association, vol. 51(2), pages 512-27, June.
- Osterdal, Lars Peter, 2005.
"Iterated weak dominance and subgame dominance,"
Journal of Mathematical Economics,
Elsevier, vol. 41(6), pages 637-645, September.
- 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.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.