A path to the Arrow-Debreu competitive market equilibrium

Mathematical Programming

Volumn 111, Issue 1-2, 2008, Pages 315-348

  Ye, Yinyu ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

ARROW-DEBREU COMPETITIVE MARKET; BARRIER FUNCTIONS; RATIONAL NUMBERS; ROUNDING TECHNIQUES;

MATHEMATICAL MODELS;

EID: 34347262148     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0065-5     Document Type: Conference Paper

References (39)

1. Arrow, K., Debreu, G.: Existence of a competitive equilibrium for a competitive economy. Econometrica 22(3), 265-290 (1954)
2. Atkinson, D.S., Vaidya, P.M.: A scaling technique for finding the weighted analytic center of a polytope. . Math. Program. 57, 163-192 (1992)
3. Brainard, W.C., Scarf, H.E.: How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper 1270, August (2000)
4. Codenotti, B., Varadarajan, K.: Efficient computation of equilibrium prices for market with Leontief utilities. In: Proc. of ICALP 2004, pp. 371-381 (2004)
5. Codenotti, B., Pemmaraju, S., Varadarajan, K.: On the polynomial time computation of equilibria for certain exchange economies. In: Proc of SODA 2005, pp. 72-81 (2005)
6. Cottle, R., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem, Chap. 5.9: Interior-point methods, pp. 461-475. Academic Boston (1992)
7. Deng, X., Huang, S., Ye, Y.: Computation of the Arrow-Debreu equilibrium for a class of non-homogenous utility functions. Technical Report, State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, 10084, China
8. Deng, X., Papadimitriou, GH., Safra, S.: On the complexity of equilibria. In: Proc. of ACM Symposium on Theory of Computing 2002, pp. 67-71 (2002)
9. Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual-type algorithm. In: Proc. of The 43rd Annual IEEE Symposium on Foundations of Computer Science 2002, pp. 389-395; Journal version on http://www.cc.gatech.edu/~saberi/ (2004)
10. Dirkse, S.P., Ferris, M.C.: A pathsearch damped Newton method for computing general equilibria. Ann. Oper. Res. 68, 211-232 (1996)
11. Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Mathe. Statist. 30, 165-168 (1959)
12. Eaves, B.C.: A finite algorithm for the linear exchange model. J. Math. Econ. 3, 197-203 (1976)
13. Eaves, B.C.: Finite solution of pure trade markets with Cobb-Douglas utilities. Math. Program. Study 23, 226-239 (1985)
14. Esteban-Bravo, M.: Computing equilibria in general equilibrium models via interior-point methods. Comput. Econ. 23(2), 147-171 (2004)
15. Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39(4), 669-713 (1997)
16. Gale, D.: The Theory of Linear Economic Models. McGraw Hill, New York (1960)
17. Ginsburgh, V., Keyzer, M.: The Structure of Applied General Equilibrium Models. The MIT Press, Cambridge (1077)
18. Guler, O.: Existence of interior points and interior paths in nonlinear monotone complementarity problems. Math. Oper. Res. 18(1), 128-147 (1993)
19. Jain, K.: A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. In: Proc. of The 43rd Annual IEEE Symposium on Foundations of Computer Science 2004, pp. 286-294 (2004)
20. Jain, K., Mahdian, M., Saberi, A.: Approximating market equilibria. In: Proc. of APPROX 2003, pp. 98-108 (2003)
21. Jain, K., Vazirani, V.V., Ye, Y.: Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. In: Proc. of SODA 2005, pp. 63-71 (2005)
22. Kojima, M., Mizuno, S., Yoshise, A.: An O(√nL) iteration potential reduction algorithm for linear complementarity problems. . Math. Program. 50, 331-342 (1991)
23. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach for interior-point algorithms for linear complementarity problems. Lecture Notes in Computer Science, vol. 538. Springer, Berlin Heidelberg New York (1991)
24. Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming Interior Point and Related Methods, pp. 131-158. Springer. Berlin Heidelberg New York (1989)
25. Mehrotra, S., Ye, Y.: On finding an interior point on the optimal face of linear programs. Math. Program. 62, 497-516 (1993)
26. Mizuno, S., Todd, M.J., Ye, Y.: On adaptive step primal-dual interior-point algorithms for linear programming.. Math. Oper. Res. 18, 964-981 (1993)
27. Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms: Part I : Linear programming. Math. Program. 44, 27-41 (1989)
28. Monteiro, R.D.C., Tsuchiya, T.: A new iteration-complexity bound for the MTY predictor-corrector algorithm. SIAM J. Optim. .15(2), 31.9-347 (2004)
29. Negishi, T.: Welfare economics and the existence of an equilibrium for a competitive economy. Metroeconomica, XII, 92-97 (1960)
30. Nenakhov, E., Primak, M.: About one algorithm for finding the solution of the Arrow-Debreu model.. Kibernetica 3, 127-128 (1983)
31. Nesterov, Yu.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM Publications. SIAM, Philadelphia (1993)
32. Primak, M.E.: A converging algorithm for a linear exchange model.. J. Math. Econ. 22(2), 181-187 (1993)
33. Rutherford, T.F.: Applied general equilibrium modeling with MPSGE as a GAMS subsystem. Comput. Econ. 14, 1-46 (1999)
34. Scarf, H.E.: The Computation of Economic Equilibria (with collaboration of T. Hansen, Cowles Foundation Monograph, No. 24. Yale University Press, New Haven (1973)
35. Todd, M.J.: The computation of fixed points and applications. (Lecture Notes in Economics and Mathematical Systems, vol. 1.24. Springer, Berlin Heidelberg New York (1976)
36. Walras, L.: Elements of Pure Economics, or the Theory of Social Wealth 1874 (1899, 4th ed.; 1926, rev ed, 1954, Engl. Transl.)
37. Yang, Z.: Computing Equilibria and Fixed Points: The Solution of Nonlinear Inequalities. Kluwer Boston (1999)
38. Ye, Y., Güler, O., Tapia, R.A., Zhang, Y.: A quadratically convergent O(√nL)-iteration algorithm for linear programming. Math. Program. 59, 151-162 (1993)
39. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley New York (1997)