Improved algorithms for computing fisher's market clearing prices

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 291-300

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

market equilibrium; strongly polynomial

Indexed keywords

IMPROVED ALGORITHM; MARKET CLEARING PRICE; MARKET EQUILIBRIA; MARKET EQUILIBRIUM; MARKET MODEL; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; STRONGLY POLYNOMIAL TIME ALGORITHM;

ALGORITHMS; COMMERCE; POLYNOMIAL APPROXIMATION; SALES;

COMPUTATION THEORY;

EID: 77954718970     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806731     Document Type: Conference Paper

References (15)

1. R.K. Ahuja, T.L. Maganti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, N.J. 1993.
2. K. Arrow and G. Debreu. Existance of an equilibrium for a competitive economy. Econometrica 22:265-290, 1954.
3. W.C. Brainard, H.E. Scarf, D. Brown, F. Kubler, and K.R. Sreenivasan. How to compute equilibrium prices in 1891. Commentary. The American Journal of Economics and Sociology 64: 57-92, 2005.
4. D. Chakrabarty, N. Devanur, and V. Vazirani. New results on rationality and strongly polynomial solvability in Eisenberg-Gale markets. In Proceedings of 2nd Workshop on Internet and Network Economics, 239-250, 2006.
5. N.R. Devanur, C.H. Papadimitriou, A. Saberi, and V.V. Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM 55: 1-18, 2008.
6. N.R. Devanur and V.V. Vazirani. The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. Proceedings of 36th Symposium on the Theory of Computing, 519-528, 2004.
7. J. Edmonds., and R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of ACM 19: 248-264, 1972.
8. E. Eisenberg and D. Gale. Consensus of subjective probabilities: the Pari-Mutuel method. Annals of Mathematical Statistics 30: 165-168, 1959.
9. M.L. Fredman, and R.E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM 34: 596-615, 1987.
10. R. Garg and S. Karpur. Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium Lecture Notes in Computer Science, Volume 4286/2006 Springer Berlin / Heidelberg 225-238, 2006.
11. M. Ghiyasvand and J.B. Orlin An improved approximation algorithm for computing Arrow-Debreu market prices MIT Technical Paper. Submitted for publication. 2009.
12. J.B. Orlin. Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem. Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA. 1984.
13. J.B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41: 338-350, 1993.
14. V.V. Vazirani. Spending constraint utilities, with applications to the Adwords market. Submitted to Math of OR, 2006.
15. V.V. Vazirani. Combinatorial Algorithms for Market Equilibrium. in N. Nisan, T. Roughgarden, E'. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, pages 103-134, Cambridge University Press, Cambridge, UK., 2007.