On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games |
scientific article |
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
