Spending is not easier than trading: On the computational equivalence of fisher and arrow-debreu equilibria

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 647-656

  Chen, Xi ^a   Teng, Shang Hua ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EQUIVALENCE; EXCHANGE MODELS; HARDNESS RESULT; LEONTIEF; MARKET EQUILIBRIA; PIECEWISE-LINEAR; POLYNOMIAL-TIME;

COMMERCE; PIECEWISE LINEAR TECHNIQUES; POLYNOMIAL APPROXIMATION;

COMPUTATION THEORY;

EID: 75649101287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_66     Document Type: Conference Paper

References (26)

1. Vazirani, V., Yannakakis, M.: PPAD-completeness of Fisher markets under piecewise-linear, concave utility functions (2009) (manuscript)
2. Brainard, W., Scarf, H.: How to compute equilibrium prices in 1891. Cowles Foundation Discussion Papers 1272, Cowles Foundation, Yale University (2000)
3. Arrow, K., Debreu, G.: Existence of an equilibrium for a competitive economy. Econometrica 22, 265-290 (1954)
4. Eisenberg, E., Gale, D.: Consensus of subjective probabilities: The pari-mutuel method. Annals of Mathematical Statistics 30(1), 165-168 (1959)
5. Nenakov, E., Primak, M.: One algorithm for finding solutions of the Arrow-Debreu model. Kibernetica, 127-128 (1983)
6. Deng, X., Papadimitriou, C., Safra, M.: On the complexity of equilibria. In: Proceedings of the 34th annual ACM symposium on Theory of computing, pp. 67-71 (2002)
7. Devanur, N., Papadimitriou, C., Saberi, A., Vazirani, V.: Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM 55(5), 1-18 (2008)
8. Jain, K.: A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 286-294 (2004)
9. Garg, R., Kapoor, S.: Auction algorithms for market equilibrium. In: Proceedings of the 36th annual ACM symposium on Theory of computing, pp. 511-518 (2004)
10. Jain, K., Mahdian, M., Saberi, A.: Approximating market equilibria. In: Proceedings of the 6th International Workshop on Approximation Algorithms, pp. 98-108 (2003)
11. Devanur, N.R., Vazirani, V.V.: An improved approximation scheme for computing Arrow-Debreu prices for the linear case. In: Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 149-155 (2003)
12. Ye, Y.: A path to the Arrow-Debreu competitive market equilibrium. Mathematical Programming 111, 315-348 (2008)
13. Codenotti, B., Pemmaraju, S., Varadarajan, K.: On the polynomial time computation of equilibria for certain exchange economies. In: Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms, pp. 72-81 (2005)
14. Devanur, N.R., Kannan, R.: Market equilibria in polynomial time for fixed number of goods or agents. In: Proceedings of the 49th annual IEEE Symposium on Foundations of Computer Science, pp. 45-53 (2008)
15. Codenotti, B., McCune, B., Penumatcha, S., Varadarajan, K.R.: Market equilibrium for CES exchange economies: Existence, multiplicity, and computation. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 505-516. Springer, Heidelberg (2005)
16. Codenotti, B., Saberi, A., Varadarajan, K., Ye, Y.: Leontief economies encode nonzero sum two-player games. In: Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 659-667 (2006)
17. Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 261-272 (2006)
18. Huang, L.-S., Teng, S.-H.: On the approximation and smoothed complexity of Leontief market equilibria. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol. 4613, pp. 96-107. Springer, Heidelberg (2007)
19. Chen, X., Dai, D., Du, Y., Teng, S.H.: Settling the complexity of Arrow-Debreu equilibria in markets with additively separable utilities. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (2009)
20. Chen, X., Huang, L.S., Teng, S.H.: Market equilibria with hybrid linear-Leontief utilities. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 274-285. Springer, Heidelberg (2006)
21. Ye, Y.: Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. Theoretical Computer Science 378(2), 134-142 (2007)
22. Jain, K., Vazirani, V., Ye, Y.: Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. In: Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms, pp. 63-71 (2005)
23. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
24. Chen, X., Deng, X., Teng, S.H.: Sparse games are hard. In: Spirakis, P.G., Mavron-icolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 262-273. Springer, Heidelberg (2006)
25. Maxfield, R.: General equilibrium and the theory of directed graphs. Journal of Mathematical Economics 27(1), 23-51 (1997)
26. Chen, X., Teng, S.H.: Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. arXiv:0907.4130 (2009)