pith. sign in

arxiv: 0904.0644 · v1 · submitted 2009-04-03 · 💻 cs.CC · cs.GT

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities

classification 💻 cs.CC cs.GT
keywords problemadditivelyarrow-debreuseparableapproximationcomplexitycomputingconcave
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.