Header

UZH-Logo

Maintenance Infos

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.

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.

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.

Statistics

Citations

6 citations in Web of Science®
8 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

99 downloads since deposited on 30 Mar 2010
32 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Economics
Dewey Decimal Classification:330 Economics
Language:English
Date:2000
Deposited On:30 Mar 2010 12:30
Last Modified:07 Dec 2017 02:02
Publisher:Elsevier
ISSN:0899-8256
Publisher DOI:https://doi.org/10.1006/game.1999.0763

Download

Download PDF  'Chess-like games are dominance solvable in at most two steps'.
Preview
Content: Accepted Version
Filetype: PDF
Size: 1MB
View at publisher