|
Organizers |
Chess-like games are dominance solvable in at most two steps
by
Christian Ewerhart
University of Mannheim
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.
Date received: June 5, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafc-79.