|
|
|
|
| LEADER |
01458 am a22002053u 4500 |
| 001 |
68009 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Orlin, James B.
|e author
|
| 100 |
1 |
0 |
|a Sloan School of Management
|e contributor
|
| 100 |
1 |
0 |
|a Orlin, James B.
|e contributor
|
| 100 |
1 |
0 |
|a Orlin, James B.
|e contributor
|
| 245 |
0 |
0 |
|a Improved Algorithms for Computing Fisher's Market Clearing Prices
|
| 260 |
|
|
|b Association for Computing Machinery,
|c 2012-01-06T16:31:07Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/68009
|
| 520 |
|
|
|a ACM Digital Library url: http://dl.acm.org/citation.cfm?id=1806731
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a United States. Office of Naval Research (ONR grant N00014-05-1-0165)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, June 5, 2010 - June 8, 2010.
|
