On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes
Computational Economics
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Simultaneous Independent Online Auctions with Discrete Bid Increments
Electronic Commerce Research
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The computation of market equilibria
ACM SIGACT News
Market equilibrium via the excess demand function
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the polynomial time computation of equilibria for certain exchange economies
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
Cell Breathing in Wireless LANs: Algorithms and Evaluation
IEEE Transactions on Mobile Computing
Theoretical Computer Science
An auction-based market equilibrium algorithm for a production model
Theoretical Computer Science
Fast-converging tatonnement algorithms for one-time and ongoing market problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An experimental study of different approaches to solve the market equilibrium problem
Journal of Experimental Algorithmics (JEA)
Market equilibrium via a primal--dual algorithm for a convex program
Journal of the ACM (JACM)
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science
Market equilibria with hybrid linear-Leontief utilities
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computing market equilibrium: beyond weak gross substitutes
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Market equilibrium with transaction costs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Price roll-backs and path auctions: an approximation scheme for computing the market equilibrium
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Market equilibria with hybrid linear-leontief utilities
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
WINE'05 Proceedings of the First international conference on Internet and Network Economics
An auction-based market equilibrium algorithm for a production model
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Computing equilibria in a fisher market with linear single-constraint production units
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Market equilibrium for CES exchange economies: existence, multiplicity, and computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Computing equilibrium prices in exchange economies with tax distortions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Tatonnement in ongoing markets of complementary goods
Proceedings of the 13th ACM Conference on Electronic Commerce
| Hi-index | 0.01 |
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 items. The market equilibrium problem is to compute a price vector which ensures market clearing, i. e. the demand of a 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 the dual of these parametrized linear programs. We show that finding the market equilibrium is the same as finding a linear-program from the family of programs where the optimal dual solution satisfies certain properties. The market clearing conditions arise naturally from complementary slackness conditions.We then define an auction mechanism which computes prices such that approximate market clearing is achieved. The algorithm we obtain outperforms previously known methods.