computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass...

is reducible to that problem. PPAD is defined in a similar way to PPA, except that it is defined on directed graphs. PPAD is a subclass of PPA. This is...

algorithms for finding equilibria. Of special importance is the complexity class PPAD, which includes many problems in algorithmic game theory. Mechanism...

Goldwasser. The complexity of decision versus search. SIAM Journal on Computing, Vol. 23, No. 1, February 1994. Daskalakis, Costis (2015). "22. PPAD". MIT OpenCourseWare...

Savani proved that a complexity class called CLS is equal to the intersection of PPAD and PLS. Equilibria, fixed points, and complexity classes: a survey...

of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics...

Additionally, if iO and one-way functions exist, then problems in the PPAD complexity class are provably hard. However, indistinguishability obfuscation...

This is a list of PPAD-complete problems. Sperner's lemma Brouwer fixed-point theorem Kakutani fixed-point theorem Nash equilibrium Core of Balanced Games...

equilibria for one-shot finite games, a problem which lies in the PPAD complexity class. The practical consequence of this is that no efficient (polynomial-time)...

that introduced PPAD and PPA. PPP contains both PPAD and PWPP (polynomial weak pigeonhole principle) as subclasses. These complexity classes are of particular...