Settling the complexity of computing two-player Nash equilibria (Q3452212): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Xiaotie Deng / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Shang-Hua Teng / rank | |||
Normal rank | |||
Revision as of 09:55, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
