Market equilibria in polynomial time for fixed number of goods or agents

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 45-53

  Devanur, Nikhil R ^a   Kannan, Ravi ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL THEOREMS; COMPUTATIONAL ALGEBRAIC GEOMETRIES; EQUILIBRIUM PROBLEMS; FIXED NUMBERS; LEONTIEF; LINEAR OPTIMIZATION PROBLEMS; MARGINAL UTILITIES; MULTI AGENTS; MULTIAGENT GAMES; POLYNOMIAL SURFACES; POLYNOMIAL TIMES; PRICE VECTORS; UTILITY FUNCTIONS;

AGENTS; COMPUTERS; COSTS; DECOMPOSITION; FIBER OPTIC CHEMICAL SENSORS; FUNCTIONS; GAME THEORY; MARKETING; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; SALES; VECTORS;

POLYNOMIAL APPROXIMATION;

EID: 57949100806     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.30     Document Type: Conference Paper

References (25)

1. K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22:265-290, 1954.
2. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43(6):1002-1045, 1996.
3. S. Basu, R. Pollack, and M.-F. Roy. Quantifier Elimination and Cylindrical Algebraic Decomposition, chapter A New Algorithm to find a point in every cell defined by a family of polynomials. Springer, 2004.
4. W. C. Brainard and H. E. Scarf. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper, (1270), 2000.
5. X. Chen and X. Deng. Settling the complexity of 2-player nash-equilibrium. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 261-272, 2006.
6. B. Codenotti, B. McCune, S. Penumatcha, and K. Varadarajan. Existence, multiplicity and computation of equilibria for CES exchange economies. In Proceedings of FSTTCS, 2005.
7. B. Codenotti, S. Pemmaraju, and K. Varadarajan. On the polynomial, time computation of equilibria for certain exchange economies. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 72-81, 2005.
8. B. Codenotti, A. Saberi, K. Varadarajan, and Y. Ye. Leontief economies encode nonzero sum two-player games. In Proceedings of ACM Symposium on Discrete Algorithms, 2006.
9. B. Codenotti and K. Varadarajan. Efficient computation of equilibrium prices for markets with Leontief utilities. In Proc 31st International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 2004.
10. C. Daskalakis, P. Goldberg, and C. Papadimitriou. Three-player games are hard. In ECCC Report, 2005. Manuscript.
11. C. Daskalakis and C. Papadimitriou. Computing equilibria in anonymous games. In In the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS., 2007.
12. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of equilibria. In Proceedings of ACM Symposium on Theory of Computing, 2002.
13. N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. To appear in The Journal of the ACM, 2008.
14. B. Eaves. Finite solution of pure trade markets with cobbdouglas utilities. Mathematical Programming Study 23, pages 226-239, 1985.
15. E. Eisenbberg and D. Gale. Consensus of subjective probabilities: the Pari-Mutuel method. The Annals of Mathematical Statistics, 30:165-168, 1959.
16. K. Jain. A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. In In Proc. of the IEEE Annual Symposium on Foundations of Computer Science FOCS, 2004.
17. S. Kakade, M. Kearns, and L. Ortiz. Graphical economics. In Computational Learning Theory, 2004.
18. O. H. Merrill. Applications and Extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings. PhD thesis, Dept. of Industrial Engineering, University of Michigan, 1972.
19. E. Nenakhov and M. Primak. About one algorithm for finding the solution of the arrow debreu model. Kibernetica, (3): 127-128, 1983.
20. C. Papadimitriou and T. Roughgarden. Computing equilibria in multi-player games. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 2005.
21. H. E. Scarf. On the computation of equilibrium prices. Cowles Foundation Discussion Papers 232, Cowles Foundation, Yale University, 1967. available at http://ideas.repec.org/p/cwl/cwldpp/232.html.
22. J. B. Shoven and J. Whaliey. Applying General Equilibrium. Cambridge University Press, 1992.
23. V. V. Vazirani. Spending constriant utilities, with applications to the adwords market. Submitted, 2006.
24. V. V. Vazirani and M. Yannakakis. Personal Communication.
25. Y. Ye. Note on exchange market equilibria with leontief s utility: Freedom of pricing leads to rationality. In Proceedings of the First Workshop on Internet and Network Economics (WINE), 2005.