PPAD-hardness for constant-δ approximate competitive equilibria in SPLC Fisher markets requires the PCP-for-PPAD conjecture, which the paper proves is necessary to establish such hardness.
[DGP09] Constantinos Daskalakis, Paul W
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.
citing papers explorer
-
Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
PPAD-hardness for constant-δ approximate competitive equilibria in SPLC Fisher markets requires the PCP-for-PPAD conjecture, which the paper proves is necessary to establish such hardness.
-
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.