Auction Algorithms for Market Equilibrium

References

• Arrow K. J., Debreu G. Existence of an equilibrium for a competitive economy. Econometrica (1954) 22:265–290Crossref, Google Scholar
• Arrow K. J., Block H. D., Hurwicz L. On the stability of the competetive equilibrium, II. Econometrica (1959) 27:82–109Crossref, Google Scholar
• Bertsekas Dimitri P. Auction algorithms for network flow problems: A tutorial introduction. Comput. Optim. Appl. (1992) 1:7–66Crossref, Google Scholar
• Brainard W. C., Scarf H. E. How to compute equilibrium prices in 1891. Amer. J. Econom. Sociol. (2005) 64:57–83Crossref, Google Scholar
• Cheng John, Wellman Michael. A convergent distributed implementation of general equilibrium outcomes. Comput. Econom. (1998) 12(1):1–24Crossref, Google Scholar
• Codenotti Bruno, Pemmaraju Sriram, Varadarajan Kasturi. The computation of market equilibria. SIGACT News (2004) 35(4):23–37Crossref, Google Scholar
• Demange Gabrielle, Gale David, Sotomayor Marilda. Multi-item auctions. J. Political Econom. (1986) 94(4):863–872Crossref, Google Scholar
• Deng Xiaotie, Papadimitriou Christos, Safra Shmuel. On the complexity of equilibria. Proc. 34th ACM Sympos. Theory Comput. (STOC 2002) (2002) May 2002Montreal, Quebec, Canada(ACM Press, New York) Crossref, Google Scholar
• Devanur Nikhil R., Vazirani Vijay V. An improved approximation scheme for computing the Arrow-Debreu prices for the linear case. Proc. Foundations Software Tech. Theoret. Comput. Sci. (FSTTCS 2003). Lecture Notes in Computer Science (2003) 2914(Springer, Berlin, Germany) Crossref, Google Scholar
• Devanur Nikhil R., Papadimitriou Christos H., Saberi Amin, Vazirani Vijay V. Market equilibrium via a primal-dual-type algorithm. Proc. 43rd Sympos. Foundations Comput. Sci. (FOCS 2002) (2002) Vancouver, BC, Canada:389–395Crossref, Google Scholar
• Eaves B. A finite algorithm for the linear exchange model. J. Math. Econom. (1976) 3(2):197–203Crossref, Google Scholar
• Eisenberg E., Gale D. Consensus of subjective probabilities: The pari-mutuel method. Ann. Math. Statist. (1959) 30:165–168Crossref, Google Scholar
• Jain Kamal. A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2004) (2004) Rome, Italy(IEEE Computer Society, Washington, DC) 286–294Crossref, Google Scholar
• Jain K., Mahdian M., Saberi A. Approximation, randomization, and combinatorial optimization: Algorithms for combinatorial optimization: Algorithms and approximation techniques. 6th Internat. Workshop Approximation Algorithms Combin. Optim. Problems (APPROX 2003). Lecture Notes in Computer Science (2003) 2764(Springer, Berlin, Germany) Google Scholar
• Kuhn H. W. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. (1955) 2:83–97Crossref, Google Scholar
• Nenakov E. I., Primak M. E. One algorithm for finding solutions of the Arrow-Debreu model. Kibernetica (1983) 3:127–128Google Scholar
• Newman D. J., Primak M. E. Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models. Appl. Math. Comput. (1992) 52:223–231Crossref, Google Scholar
• Papadimitriou Christos H. On the complexity of the parity-argument and other inefficient proofs of existence. J. Comput. System Sci. (1994) 48(3):498–532Crossref, Google Scholar
• Primak M. E. A converging algorithm for a linear exchange model. Appl. Math. Comput. (1992) 52:223–231Crossref, Google Scholar
• Samuelson P. A.Foundations of Economic Analysis (1947) (Harvard University Press, Cambridge, MA) Google Scholar
• Walras L.Elements of Pure Economics, or the Theory of Social Wealth (1874) (Lausanne, Switzerland, and Paris, France). (In French.)Google Scholar
• Ye Yinyu. A path to the Arrow-Debreu competitive market equilibrium. Math. Programming (2006) . ForthcomingGoogle Scholar