On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: New complexity results about Nash equilibria / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nash and correlated equilibria: Some complexity considerations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equilibrium Points of Bimatrix Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-cooperative games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms, games, and the internet / rank | |||
Normal rank |
Revision as of 05:38, 2 July 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