{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:56:35Z","timestamp":1781078195742,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806731","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"291-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Improved algorithms for computing fisher's market clearing prices"],"prefix":"10.1145","author":[{"given":"James B.","family":"Orlin","sequence":"first","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R.K.","year":"1993","unstructured":"R.K. Ahuja , T.L. Maganti , and J.B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , N.J. 1993 . R.K. Ahuja, T.L. Maganti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, N.J. 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907353"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1536-7150.2005.00349.x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411512"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007431"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_21"},{"key":"e_1_3_2_1_11_1","volume-title":"An improved approximation algorithm for computing Arrow-Debreu market prices MIT Technical Paper. Submitted for publication","author":"Ghiyasvand M.","year":"2009","unstructured":"M. Ghiyasvand and J.B. Orlin . An improved approximation algorithm for computing Arrow-Debreu market prices MIT Technical Paper. Submitted for publication . 2009 . M. Ghiyasvand and J.B. Orlin. An improved approximation algorithm for computing Arrow-Debreu market prices MIT Technical Paper. Submitted for publication. 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.2.338"},{"key":"e_1_3_2_1_14_1","volume-title":"Spending constraint utilities, with applications to the Adwords market. Submitted to Math of OR","author":"Vazirani V.V.","year":"2006","unstructured":"V.V. Vazirani . Spending constraint utilities, with applications to the Adwords market. Submitted to Math of OR , 2006 . V.V. Vazirani. Spending constraint utilities, with applications to the Adwords market. Submitted to Math of OR, 2006."},{"key":"e_1_3_2_1_15_1","first-page":"103","volume-title":"N. Nisan, T. Roughgarden, E'","author":"Vazirani V.V.","year":"2007","unstructured":"V.V. Vazirani . Combinatorial Algorithms for Market Equilibrium . in N. Nisan, T. Roughgarden, E' . Tardos, and V. Vazirani, editors, Algorithmic Game Theory, pages 103 -- 134 , Cambridge University Press , Cambridge, UK., 2007 . V.V. Vazirani. Combinatorial Algorithms for Market Equilibrium. in N. Nisan, T. Roughgarden, E'. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, pages 103--134, Cambridge University Press, Cambridge, UK., 2007."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806731"}},"subtitle":["computing fisher's market clearing prices"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":14,"alternative-id":["10.1145\/1806689.1806731","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806731","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}