The Complexity of Nash Equilibria
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Constantinos_Daskalakis
gptkb:Christos_Papadimitriou gptkb:Paul_W._Goldberg |
| gptkbp:citation |
many works in algorithmic game theory
|
| gptkbp:doi |
10.1137/070699652
|
| gptkbp:language |
English
|
| gptkbp:publicationYear |
2009
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:result |
computing a Nash equilibrium is PPAD-complete
|
| gptkbp:topic |
gptkb:Nash_equilibrium
computational complexity |
| gptkbp:bfsParent |
gptkb:Costis_Daskalakis
|
| gptkbp:bfsLayer |
7
|
| http://www.w3.org/2000/01/rdf-schema#label |
The Complexity of Nash Equilibria
|