The complexity of computing a Nash equilibrium (Q2931371): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1223123 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Christos H. Papadimitriou / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2140790422 / rank | |||
Normal rank | |||
Latest revision as of 02:21, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing a Nash equilibrium |
scientific article |
Statements
The complexity of computing a Nash equilibrium (English)
0 references
25 November 2014
0 references
Nash equilibrium
0 references
PPAD-completeness
0 references
complexity
0 references
game theory
0 references
