Name
Abstract | ||
|---|---|---|
This paper deals with the computational complexity of some yes/no problems associated with sequential elimination of strategies using three domination relations: strong domination (strict inequalities), weak domination (weak inequalities), and domination (the asymmetric part of weak domination). Classification of various problems as polynomial or NP-complete seems to suggest that strong domination is a simple notion, whereas weak domination and domination are complicated ones. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1287/moor.18.3.553 | Mathematics of Operations Research |
Keywords | DocType | Volume |
games,computability,computational complexity | Journal | 18 |
Issue | ISSN | Citations |
3 | 0364-765X | 22 |
PageRank | References | Authors |
6.54 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Itzhak Gilboa | 1 | 195 | 47.50 |
| Ehud Kalai | 2 | 135 | 44.65 |
| Eitan Zemel | 3 | 383 | 79.74 |