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

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

2009-04-03

arxiv.org/abs/0904.0644v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122776