By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xi Chen ; Princeton Univ., Princeton, NJ, USA ; Decheng Dai ; Ye Du ; Shang-Hua Teng

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.

Published in:

Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on

Date of Conference:

25-27 Oct. 2009