Construct · 1 fields · 1 citations

PPAD-completeness of Nash equilibrium: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithmic game theory

the result that finding a Nash equilibrium of a finite game is complete for the class PPAD, suggesting no efficient general algorithm exists.

In algorithmic game theory, PPAD-completeness of Nash equilibrium refers to the result that finding a Nash equilibrium of a finite game is complete for the class PPAD, suggesting no efficient general algorithm exists. This meaning comes from Daskalakis (2009) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how PPAD-completeness of Nash equilibrium sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

class3 fields · 3 citationsjingle · one word, three constructs equilibrium4 fields · 4 citationsjingle · one word, four constructs game2 fields · 3 citationsjingle · one word, two constructs

References

Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009). The Complexity of Computing a Nash Equilibrium. SIAM Journal on Computing, 39(1), 195-259. https://doi.org/10.1137/070699652

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct