dc.contributor.author | Orlin, James B. | |
dc.date.accessioned | 2012-01-06T16:31:07Z | |
dc.date.available | 2012-01-06T16:31:07Z | |
dc.date.issued | 2010-06 | |
dc.identifier.issn | 978-1-4503-0050-6 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/68009 | |
dc.description | ACM Digital Library url: http://dl.acm.org/citation.cfm?id=1806731 | en_US |
dc.description.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. | en_US |
dc.description.sponsorship | United States. Office of Naval Research (ONR grant N00014-05-1-0165) | en_US |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1145/1806689.1806731 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | Prof. Orlin via Alex Caracuzzo | en_US |
dc.title | Improved Algorithms for Computing Fisher's Market Clearing Prices | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Sloan School of Management | en_US |
dc.contributor.approver | Orlin, James B. | |
dc.contributor.mitauthor | Orlin, James B. | |
dc.relation.journal | Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, June 5, 2010 - June 8, 2010. | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Orlin, James B. | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-7488-094X | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |