Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Market equilibrium via the excess demand function
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A path to the Arrow–Debreu competitive market equilibrium
Mathematical Programming: Series A and B
A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium for Linear Utilities
SIAM Journal on Computing
Market equilibrium via a primal--dual algorithm for a convex program
Journal of the ACM (JACM)
Proceedings of the forty-second ACM symposium on Theory of computing
Market equilibrium for CES exchange economies: existence, multiplicity, and computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices
Operations Research
| Hi-index | 0.00 |
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities. Our algorithm views the allocation of money as flows and iteratively improves the balanced flow as in [Devanur et al. 2008] for Fisher's model. We develop new methods to carefully deal with the flows and surpluses during price adjustments. In our algorithm, we need O(n6log(nU)) maximum flow computations, where n is the number of persons and U is the maximum integer utility, and the length of the numbers is at most O(nlog(nU)) to guarantee an exact solution. The previous polynomial time algorithms [Nenakov and Primak 1983, Jain 2007, Ye 2007] for this problem are based on solving convex programs using the ellipsoid algorithm or interior-point method.