On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739)
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: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games |
scientific article; zbMATH DE number 5642332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games |
scientific article; zbMATH DE number 5642332 |
Statements
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (English)
0 references
4 December 2009
0 references
NP-completeness
0 references
computational complexity
0 references
bimatrix games
0 references
Nash equilibrium
0 references
imitation games
0 references
