Chess-like games are dominancesolvable in at most two steps

Christian Ewerhart

No 00-24, Sonderforschungsbereich 504 Publications from Sonderforschungsbereich 504, Universität Mannheim, Sonderforschungsbereich 504, University of Mannheim

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.

Pages: 14 pages
Date: 2000-03-30
References: Add references at CitEc
Citations: View citations in EconPapers (9)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Chess-like Games Are Dominance Solvable in at Most Two Steps (2000)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:xrs:sfbmaa:00-24

Ordering information: This working paper can be ordered from

Access Statistics for this paper

More papers in Sonderforschungsbereich 504 Publications from Sonderforschungsbereich 504, Universität Mannheim Contact information at EDIRC., Sonderforschungsbereich 504, University of Mannheim
Bibliographic data for series maintained by Carsten Schmidt ( this e-mail address is bad, please contact ).