The computational complexity of iterated elimination of dominated strategies (Q315527)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of iterated elimination of dominated strategies |
scientific article; zbMATH DE number 6628964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of iterated elimination of dominated strategies |
scientific article; zbMATH DE number 6628964 |
Statements
The computational complexity of iterated elimination of dominated strategies (English)
0 references
21 September 2016
0 references
computational complexity
0 references
normal form game
0 references
dominated strategies
0 references
strategy elimination
0 references
0.8932179808616638
0 references
0.8920681476593018
0 references
0.8639750480651855
0 references
0.8638525009155273
0 references
0.8617507815361023
0 references
