Settling the complexity of computing two-player Nash equilibria (Q3452212)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Settling the complexity of computing two-player Nash equilibria |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Settling the complexity of computing two-player Nash equilibria |
scientific article |
Statements
Settling the complexity of computing two-player Nash equilibria (English)
0 references
11 November 2015
0 references
Arrow-Debreu market
0 references
Brouwer's fixed point
0 references
Lemke-Howson algorithm
0 references
Nash equilibrium
0 references
PPAD-completeness
0 references
Sperner's lemma
0 references
two-player game
0 references
smoothed analysis
0 references
0.9331759214401244
0 references
0.9258604645729064
0 references
0.8948028087615967
0 references
0.8825392723083496
0 references
0.8801851272583008
0 references
