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.
Chess-like games are dominance solvable in at most two steps
Ewerhart, Christian (2000). Chess-like games are dominance solvable in at most two steps. Games and Economic Behavior, 33(1):41-47.
Additional indexing
| Item Type: | Journal Article, refereed, original work |
|---|---|
| Communities & Collections: | 03 Faculty of Economics > Department of Economics |
| Dewey Decimal Classification: | 330 Economics |
| Scopus Subject Areas: | Social Sciences & Humanities > Finance
Social Sciences & Humanities > Economics and Econometrics |
| Scope: | Discipline-based scholarship (basic research) |
| Language: | English |
| Date: | 2000 |
| Deposited On: | 30 Mar 2010 12:30 |
| Last Modified: | 04 Mar 2025 02:37 |
| Publisher: | Elsevier |
| ISSN: | 0899-8256 |
| OA Status: | Green |
| Publisher DOI: | https://doi.org/10.1006/game.1999.0763 |
| Other Identification Number: | merlin-id:2032 |
Permanent URL
https://doi.org/10.5167/uzh-33209
Download
Preview
Links
Statistics
Citations
Dimensions.ai Metrics
Ewerhart, Christian