Auction Algorithms for Market Equilibrium

In this paper we study algorithms for computing market equilibrium in markets with linear utility functions. The buyers in the market have an initial endowment given by a portfolio of goods. The market equilibrium problem is to compute a price vector that ensures market clearing, i.e., the demand of a positively priced good equals its supply, and given the prices, each buyer maximizes its utility. The problem is of considerable interest in economics. This paper presents a formulation of the market equilibrium problem as a parameterized linear program. We construct a family of duals corrresponding to these parameterized linear programs and show that finding the market equilibrium is the same as finding a linear program from this family of linear programs. The market-clearing conditions arise naturally from complementary slackness conditions. We then define an auction mechanism that computes prices such that approximate market clearing is achieved. The algorithm we obtain outperforms previously known methods.

[1]  P. Samuelson,et al.  Foundations of Economic Analysis. , 1948 .

[2]  K. Arrow,et al.  EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .

[3]  L. Walras.  Elements of Pure Economics, or The Theory of Social Wealth , 1955 .

[4]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[5]  L. Hurwicz,et al.  ON THE STABILITY OF THE COMPETITIVE EQUILIBRIUM, I1 , 1958 .

[6]  E. Eisenberg,et al.  CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .

[7]  B. Eaves.  A finite algorithm for the linear exchange model , 1976 .

[8]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

[9]  D. Newman,et al.  Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models , 1992 .

[10]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[11]  M. Primak.  A converging algorithm for a linear exchange model , 1993 .

[12]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[13]  Michael P. Wellman,et al.  The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes , 1998 .

[14]  Xiaotie Deng,et al.  On the complexity of equilibria , 2002, STOC '02.

[15]  Nikhil R. Devanur,et al.  Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[16]  Nikhil R. Devanur,et al.  An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case , 2003, FSTTCS.

[17]  Kamal Jain,et al.  A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities , 2004, FOCS.

[18]  Sriram V. Pemmaraju,et al.  The computation of market equilibria , 2004, SIGA.

[19]  H. Scarf,et al.  How to Compute Equilibrium Prices in 1891 , 2005 .

[20]  Yinyu Ye,et al.  A path to the Arrow–Debreu competitive market equilibrium , 2007, Math. Program..