The Complexity of Computing a Nash Equilibrium (Q5189544): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/siamcomp/DaskalakisGP09, #quickstatements; #temporary_batch_1731508824982 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002373723 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/DaskalakisGP09 / rank | |||
Normal rank | |||
Latest revision as of 16:31, 13 November 2024
scientific article; zbMATH DE number 5682431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Computing a Nash Equilibrium |
scientific article; zbMATH DE number 5682431 |
Statements
The Complexity of Computing a Nash Equilibrium (English)
0 references
17 March 2010
0 references
complexity
0 references
Nash equilibrium
0 references
game theory
0 references
PPAD-completeness
0 references
