Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Auction algorithms for market equilibrium
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
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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
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
Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality
Theoretical Computer Science
Theoretical Computer Science
Proportional response dynamics leads to market equilibrium
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An experimental study of different approaches to solve the market equilibrium problem
Journal of Experimental Algorithmics (JEA)
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science
Proportional Response Dynamics in the Fisher Market
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
A note on equilibrium pricing as convex optimization
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Extending polynomial time computability to markets with demand correspondences
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On competitiveness in uniform utility allocation markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Nash equilibria in fisher market
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Proportional response dynamics in the Fisher market
Theoretical Computer Science
Distributed algorithms via gradient descent for fisher markets
Proceedings of the 12th ACM conference on Electronic commerce
Computing equilibrium prices: does theory meet practice?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exchange market equilibria with leontief’s utility: freedom of pricing leads to rationality
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A fixed point approach for the computation of market equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A practical algorithm for the computation of market equilibrium with logarithmic utility functions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
The complexity of non-monotone markets
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
The problem of computing equilibria for exchange economies has recently started to receive a great deal of attention in the theoretical computer science community. It has been shown that equilibria can be computed in polynomial time in various special cases, the most important of which are when traders have linear, Cobb-Douglas, or a range of CES utility functions. These important special cases are instances when the market satisfies a property called weak gross substitutability. Classical results in economics, which theoretical computer scientists (including us) appear to have been hitherto unaware of, show that the equilibrium prices in such markets are characterized by an infinite number of linear inequalities and therefore form a convex set. In this paper, we show that under fairly general assumptions, there are polynomial-time algorithms to compute equilibria in such markets. To the best of our knowledge, these are the first polynomial-time algorithms for exchange markets under the general setting of weak gross substitutability. To show this result, we need to build on the proofs that characterize the equilibria as a convex set.As a consequence, we obtain alternative polynomial-time algorithms for computing equilibria with linear, Cobb-Douglas, a range of CES, as well as certain other non-homogeneous utility functions that satisfy weak gross substitutability. Unlike previous polynomial-time algorithms, our approach does not make use of the specific form of these utility functions and is in this sense more general. We expect our framework to work or be readily adaptable to handle other exchange markets, provided that the utility functions satisfy weak gross substitutability.