Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
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
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Spending Constraint Utilities with Applications to the Adwords Market
Mathematics of Operations Research
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
| Hi-index | 0.01 |
We present a polynomial time algorithm that computes an approximate equilibrium for any exchange economy with a demand correspondence satisfying gross substitutability. Such a result was previously known only for the case where the demand is a function, that is, at any price, there is only one demand vctor. The case of multi valued demands that is dealt with here arises in many settings, notably when the traders have linear utilities. We also show that exchange markets in the spending constraint model have demand correspodences satisfying gross substitutability and that they always have an equilibrium price vector with rational numbers. As a consequence, the framework considered here leads to the first exact polynomial time algorithm for this model.