Market equilibrium under separable, piecewise-linear, concave utilities

Journal of the ACM

Volumn 58, Issue 3, 2011, Pages

  Vazirani, Vijay V ^a   Yannakakis, Mihalis ^b  

^a Georgia Institute of Technology   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

Arrow debreu market; Fisher market; Market equilibria; Piecewise linear utilities; PPAD

Indexed keywords

ARROW-DEBREU MARKET; FISHER MARKET; MARKET EQUILIBRIA; PIECEWISE-LINEAR; PPAD;

MODEL CHECKING; PIECEWISE LINEAR TECHNIQUES;

COMMERCE;

EID: 79960678639     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1970392.1970394     Document Type: Conference Paper

References (28)

1. ARROW, K., AND DEBREU, G. 1954. Existence of an equilibrium for a competitive economy. Econometrica 22, 265-290.
2. BRAINARD, W. C., AND SCARF, H. E. 2000. How to compute equilibrium prices in 1891. Cowles Foundation discussion paper. 1270.
3. CHEN, X.,DAI, D.,DU, Y., AND TENG, S.-H. 2009a. Settling the complexity of Arrow-Debreu equilibria inmarkets with additively separable utilities. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS).
4. CHEN, X., DENG, X., AND TENG, S.-H. 2009b. Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3.
5. CHEN, X., AND TENG, S.-H. 2009. Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC). 647-656.
6. CODENOTTI, B., SABERI, A., VARADARAJAN, K., AND YE, Y. 2006. Leontief economies encode two-player zero-sum games. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
7. CODENOTTI, B., AND VARADARAJAN, K. 2004. Efficient computation of equilibrium prices for markets with Leontief utilities. In Proceedings of the Conference on Automation Languages and Programming (ICALP).
8. DASKALAKIS, C., GOLDBERG, P., AND PAPADIMITRIOU, C. 2009. The complexity of computing a Nash equilibrium. SIAM J. Comput. 39, 1, 195-259.
9. DENG, X., AND DU, Y. 2008. The computation of approximate competitive equilibrium is PPAD-hard. Inform. Proc. Lett. 108, 369-373.
10. DEVANUR, N., AND KANNAN, R. 2008. Market equilibria in polynomial time for fixed number of goods or agents. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). 45-53.
11. DEVANUR, N., PAPADIMITRIOU, C. H., SABERI, A., AND VAZIRANI, V. V. 2008. Market equilibrium via a primal-dualtype algorithm. J. ACM 55, 5.
12. EAVES, B. C. 1976. A finite algorithm for the linear exchange model. J. Math. Econ. 3, 197-203.
13. ETESSAMI, K., AND YANNAKAKIS, M. 2010. On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39, 6, 2531-2597.
14. GALE, D. 1960. Theory of Linear Economic Models. McGraw-Hill, New York.
15. GALE, D. 1976. The linear exchange model. J. Math. Econ. 3, 205-209.
16. GAREY,M. R., AND JOHNSON,D. S. 1979. Computer and Intractability: AGuide to the Theory ofNP-Completeness. Freeman.
17. GOEL, G., AND VAZIRANI, V. V. 2010. A perfect price discrimination market model with production and a (rational) convex program for it. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT). 186-197.
18. HUANG, L.-S., AND TENG, S.-H. 2007. On the approximation and smoothed complexity of leontief market equilibria. In Proceedings of the 1st Annual International Workshop in Frontiers in Algorithmics (FAW). Lecture Notes in Computer Science, vol. 4613, Springer, 96-107.
19. JAIN, K. 2007. A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. SICOMP 37, 1, 303-318. (Pubitemid 351321998)
20. LEMKE, C., AND HOWSON, J. 1964. Equilibrium points of bimatrix games. J. SIAM, 413-423.
21. MAXFIELD, R. R. 1997. General equilibrium and the theory of directed graphs. J. Math. Econ. 27, 1, 23-51. (Pubitemid 127162169)
22. MEGIDDO, N. 1988. A note on the complexity of P-matrix LCP and computing an equilibrium. IBM Res. rep. 6439. http://theory.stanford.edu/m̃ egiddo/pdf/plcp.pdf.
23. MEGIDDO, N., AND PAPADIMITRIOU, C. 1991. On total functions, existence theorems, and computational complexity. Theoret. Comput. Sci. 81, 317-324. (Pubitemid 21668128)
24. PAPADIMITRIOU, C. 1994. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48, 3, 498-532. (Pubitemid 124013301)
25. SCARF, H. 1967. The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15, 1328-1343.
26. SCARF, H. 1973. The Computation of Economic Equilibria. Yale University Press.
27. UZAWA, H. 1962. Walras' existence theorem and Brower's fixpoint theorem. Econ. Stud. Quart. 13, 59-62.
28. YE, Y. 2007. Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. Theoret. Comput. Sci. 378, 134-142. (Pubitemid 46719675)