PPAD-completeness
Description: PPAD-completeness is a computational complexity classification for problems that are as hard as every problem in PPAD, a class associated with finding equilibria.
Primary topic: Game Theory and Applications (54%)
OpenAlex ID: keywords/ppad-completeness
