On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.01.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043166017 / rank | |||
Normal rank | |||
Revision as of 18:09, 19 March 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
