ArXiv.org · 2009 · 14 citations · 16 references
Social SciencesEconomicsMathematicsGame TheoryMathematical EconomicsMicroeconomicsApproximation AlgorithmsGeneral Equilibrium TheoryNash EquilibriumNoncooperative Game TheoryUtility FunctionsApproximation Algorithms For EquilibriaComputational Complexity Of EquilibriaEquilibrium Computation In MarketsEquilibrium ProblemsFully Polynomial-time Approximation SchemePolynomial Time ComplexityPolynomial-time AlgorithmsPolynomial-time Approximation Scheme
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility functions. In fact, our proof shows that this market-equilibrium problem does not have a fully polynomial-time approximation scheme unless every problem in PPAD is solvable in polynomial time.
16
Settling the Complexity of Two-Player Nash Equilibrium
Xi Chen, Xiaotie Deng · 2006 · 505 citations
On the complexity of equilibria
Xiaotie Deng, Christos H. Papadimitriou · 2002 · 138 citations