On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth 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
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
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
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Auction Algorithms for Market Equilibrium
Mathematics of Operations Research
Algorithmic Game Theory
| Hi-index | 0.00 |
In this paper we consider the problem of computing market equilibrium when utilties are homothetic concave functions. We use the Fisher market model. The problem of finding a tâtonnement process for equilibrium in this case has been the subject of recent papers and determining an approximation is of considerable interest. Our buy-sell algorithm starts with an arbitrary price vector and converges to an ε -equilibrium price vector in time proportional to O (1/ε 2). This process attempts to closely mimic the convergence process of real-life markets.