On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q196037 |
Changed an Item |
||
| Property / author | |||
| Property / author: Daniel Štefanković / rank | |||
Normal rank | |||
Revision as of 11:48, 10 February 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
