Improved Algorithms for Computing Fisher's Market Clearing Prices
Name
STOC131-Orlin.pdf
Description
https://public.me.com/orlin2
Size
215.15 KB
Format
Adobe PDF
Checksum (MD5)
27f870722636f419b477f088cfbff518
Author(s)
Orlin, James B.
Date Issued
June 2010
Journal
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, June 5, 2010 - June 8, 2010.
Publisher
Association for Computing Machinery
Citation
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.
Version
Author's final manuscript
Abstract
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.
Description
ACM Digital Library url: http://dl.acm.org/citation.cfm?id=1806731
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1806689.1806731
