Construct · 1 fields · 1 citations

PPAD: 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 complexity class of search problems whose solutions are guaranteed by a directed parity argument, capturing fixed points and equilibria.

In algorithmic game theory, PPAD refers to the complexity class of search problems whose solutions are guaranteed by a directed parity argument, capturing fixed points and equilibria. This meaning comes from Papadimitriou (1994) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

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

See how PPAD 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

argument3 fields · 3 citationsjingle · one word, three constructs class3 fields · 3 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs

References

Papadimitriou, C. H. (1994). On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48(3), 498-532. https://doi.org/10.1016/s0022-0000(05)80063-7

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