Chess-like Games Are Dominance Solvable in at Most Two Steps
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.
(This abstract was borrowed from another version of this item.)
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.:
- Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-1151, November.
- Borgers, Tilman, 1993. "Pure Strategy Dominance," Econometrica, Econometric Society, vol. 61(2), pages 423-430, March.
- 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.
- 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.
- Gul, Faruk, 1996. "Rationality and Coherent Theories of Strategic Behavior," Journal of Economic Theory, Elsevier, vol. 70(1), pages 1-31, July.
- Samuelson, Larry, 1992. "Dominated strategies and common knowledge," Games and Economic Behavior, Elsevier, vol. 4(2), pages 284-313, April.
- Aumann, Robert J., 1995. "Backward induction and common knowledge of rationality," Games and Economic Behavior, Elsevier, vol. 8(1), pages 6-19.
- 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)