On the approximation and smoothed complexity of leontief market equilibria

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

Volumn 4613 LNCS, Issue , 2007, Pages 96-107

  Huang, Li Sha ^a   Teng, Shang Hua ^b,c  

^a TSINGHUA UNIVERSITY   (China)

^b BOSTON UNIVERSITY   (United States)

^c AKAMAI TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; MARKETING; POLYNOMIALS;

ARROW-DEBREU EQUILIBRIUM; LEONTIEF MARKET EQUILIBRIA;

APPROXIMATION ALGORITHMS;

EID: 38049126257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73814-5_9     Document Type: Conference Paper

References (17)

1. Chen, X., Deng, X.: 3-Nash is PPAD-complete. ECCC, TR05-134 (2005)
2. Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. In: The Proceedings of FOCS 2006, pp. 261-272 (2006)
3. Chen, X., Deng, X., Teng, S.-H.: Computing Nash Equilibria: Approximation and smoothed complexity. In: The Proceedings of FOCS 2006, pp. 603-612 (2006)
4. Codenotti, B., Saberi, A., Varadarajan, K., Ye, Y.: Leontief economies encode nonzero sum two-player games. In: The Proceedings of SODA 2006, pp. 659-667 (2006)
5. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. In: The Proceedings of STOC 2006, pp. 71-78 (2006)
6. Daskalakis, C., Papadimitriou, C.H.: Three-player games are hard. ECCC, TR05-139 (2005)
7. Deng, X., Papadimitriou, C., Safra, S.: On the complexity of price equilibria. Journal of Computer and System Sciences 67(2), 311-324 (2003)
8. Deng, X., Huang, L.-S.: Approximate Economic Equilibrium Algorithms. In: Gonzalez, T. (ed.) Approximation Algorithms and Metaheuristics (2005)
9. Lemke, C.E., Howson Jr., J.T.: Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math. 12, 413-423 (1964)
10. Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: The Proceedings of EC 2003, pp. 36-41 (2003)
11. Nash, J.: Noncooperative games. Annals of Mathematics 54, 289-295 (1951)
12. Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48(3), 498-532 (1994)
13. Scarf, H.: The Computation of Economic Equilibria. Yale University Press, New Haven, CT (1973)
14. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385-463 (2004)
15. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms and heuristics: Progress and open questions. In: The Proceedings of Foundations of Computational Mathematics, pp. 274-342 (2006)
16. Walras, L.: Elements of Pure Economics, or the Theory of Social Wealth (1874)
17. Ye, Y.: On exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 14-23. Springer, Heidelberg (2005)