Improved Algorithms for Computing Fisher's Market Clearing Prices
Author(s)Orlin, James B.
MetadataShow full item record
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.
ACM Digital Library url: http://dl.acm.org/citation.cfm?id=1806731
DepartmentSloan School of Management
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, June 5, 2010 - June 8, 2010.
Association for Computing Machinery
Orlin, James B. “Improved algorithms for computing fisher’s market clearing prices.” Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, ACM Press, 2010. 291.
Author's final manuscript