Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
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
Market equilibrium via a primal--dual algorithm for a convex program
Journal of the ACM (JACM)
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
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A simplex-like algorithm for fisher markets
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Nash equilibria in fisher market
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Market equilibrium with transaction costs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Journal of the ACM (JACM)
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tatonnement in ongoing markets of complementary goods
Proceedings of the 13th ACM Conference on Electronic Commerce
Incentive ratios of fisher markets
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices
Operations Research
A combinatorial polynomial algorithm for the linear arrow-debreu market
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We give the first strongly polynomial time algorithm for computing an equilibrium for the linear utilities case of Fisher's market model. We consider a problem with a set B of buyers and a set G of divisible goods. Each buyer i starts with an initial integral allocation ei of money. The integral utility for buyer i of good j is Uij. We first develop a weakly polynomial time algorithm that runs in O(n4 log Umax + n3 emax) time, where n = |B| + |G|. We further modify the algorithm so that it runs in O(n4 log n) time. These algorithms improve upon the previous best running time of O(n8 log Umax + n7 log emax), due to Devanur et al.