Self-adjusting binary search trees
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
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 path to the Arrow–Debreu competitive market equilibrium
Mathematical Programming: Series A and B
A Fast and Simple Algorithm for Computing Market Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Market equilibrium using auctions for a class of gross-substitute utilities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Proceedings of the forty-second ACM symposium on Theory of computing
Market equilibrium with transaction costs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
| Hi-index | 0.01 |
In this paper we investigate the structure of prices in approximate solutions to the market equilibrium problem. The bounds achieved allow a scaling approach for computing market equilibrium in the Fisher model. Our algorithm computes an exact solution and improves the complexity of previously known combinatorial algorithms for the problem. It consists of a price roll-back step combined with the auction steps of [11]. Our approach also leads to an efficient polynomial time approximation scheme. We also show a reduction from a flow problem to the market equlibrium problem, illustrating its inherent complexity.