{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:05:32Z","timestamp":1774368332445,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T00:00:00Z","timestamp":1307232000000},"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":[[2011,6,5]]},"DOI":"10.1145\/1993574.1993594","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"127-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Distributed algorithms via gradient descent for fisher markets"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Birnbaum","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}]},{"given":"Nikhil R.","family":"Devanur","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Lin","family":"Xiao","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386832"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907779"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386831"},{"key":"e_1_3_2_1_4_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1999","unstructured":"D. P. Bertsekas . Nonlinear Programming . Athena Scientific , 2 nd edition, 1999 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, 2nd edition, 1999.","edition":"2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"e_1_3_2_1_6_1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas Dimitri P.","year":"1997","unstructured":"Dimitri P. Bertsekas and John N. Tsitsiklis . Parallel and Distributed Computation: Numerical Methods . Athena Scientific , 1997 . Dimitri P. Bertsekas and John N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.29"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374422"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060601"},{"key":"e_1_3_2_1_12_1","first-page":"72","volume-title":"SODA","author":"Codenotti Bruno","year":"2005","unstructured":"Bruno Codenotti , Sriram V. Pemmaraju , and Kasturi R. Varadarajan . On the polynomial time computation of equilibria for certain exchange economies . In SODA , pages 72 -- 81 , 2005 . Bruno Codenotti, Sriram V. Pemmaraju, and Kasturi R. Varadarajan. On the polynomial time computation of equilibria for certain exchange economies. In SODA, pages 72--81, 2005."},{"key":"e_1_3_2_1_13_1","first-page":"169","volume-title":"SODA","author":"Chien Steve","year":"2007","unstructured":"Steve Chien and Alistair Sinclair . Convergence to approximate Nash equilibria in congestion games . In SODA , pages 169 -- 178 , 2007 . Steve Chien and Alistair Sinclair. Convergence to approximate Nash equilibria in congestion games. In SODA, pages 169--178, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109629"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"e_1_3_2_1_16_1","volume-title":"Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. CoRR, abs\/0907.4130","author":"Chen Xi","year":"2009","unstructured":"Xi Chen and Shang-Hua Teng . Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. CoRR, abs\/0907.4130 , 2009 . Xi Chen and Shang-Hua Teng. Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. CoRR, abs\/0907.4130, 2009."},{"key":"e_1_3_2_1_17_1","volume-title":"Algorithmic Game Theory","author":"Codenotti Bruno","year":"2007","unstructured":"Bruno Codenotti and Kasturi Varadarajan . Algorithmic Game Theory , chapter Computation of Market Equilibria by Convex Programming. Cambridge University Press , 2007 . Bruno Codenotti and Kasturi Varadarajan. Algorithmic Game Theory, chapter Computation of Market Equilibria by Convex Programming. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_18_1","volume-title":"Fisher markets and convex programs. Working paper available from http:\/\/research.microsoft.com\/en-us\/um\/people\/nikdev\/","author":"Devanur Nikhil R","year":"2009","unstructured":"Nikhil R Devanur . Fisher markets and convex programs. Working paper available from http:\/\/research.microsoft.com\/en-us\/um\/people\/nikdev\/ , 2009 . Nikhil R Devanur. Fisher markets and convex programs. Working paper available from http:\/\/research.microsoft.com\/en-us\/um\/people\/nikdev\/, 2009."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132527"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.30"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509920"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411512"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007431"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0216"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447384"},{"key":"e_1_3_2_1_28_1","volume-title":"Eisenberg-Gale markets: algorithms and game-theoretic properties. Games and Economic Behavior, 70(1)","author":"Jain Kamal","year":"2010","unstructured":"Kamal Jain and Vijay V. Vazirani . Eisenberg-Gale markets: algorithms and game-theoretic properties. Games and Economic Behavior, 70(1) , 2010 . Kamal Jain and Vijay V. Vazirani. Eisenberg-Gale markets: algorithms and game-theoretic properties. Games and Economic Behavior, 70(1), 2010."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"e_1_3_2_1_31_1","volume-title":"Manuscript","author":"Kelly F. P.","year":"2002","unstructured":"F. P. Kelly and V. V. Vazirani . Rate control as a market equilibrium . Manuscript , 2002 . F. P. Kelly and V. V. Vazirani. Rate control as a market equilibrium. Manuscript, 2002."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402987"},{"key":"e_1_3_2_1_33_1","volume-title":"Lectures on modern convex optimization. Lecture notes","author":"Nemirovski A.","year":"2005","unstructured":"A. Nemirovski . Lectures on modern convex optimization. Lecture notes , Georgia Institute of Technology , 2005 . A. Nemirovski. Lectures on modern convex optimization. Lecture notes, Georgia Institute of Technology, 2005."},{"key":"e_1_3_2_1_34_1","volume-title":"A method for unconstrained convex minimization problem with the rate of convergence o(1\/k<sup>2<\/sup>). Soviet Math. Docl. (Doklady AN SSSR), 269:543--547","author":"Nesterov Yu.","year":"1983","unstructured":"Yu. Nesterov . A method for unconstrained convex minimization problem with the rate of convergence o(1\/k<sup>2<\/sup>). Soviet Math. Docl. (Doklady AN SSSR), 269:543--547 , 1983 . Yu. Nesterov. A method for unconstrained convex minimization problem with the rate of convergence o(1\/k<sup>2<\/sup>). Soviet Math. Docl. (Doklady AN SSSR), 269:543--547, 1983."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670022"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_1_37_1","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky A.","year":"1983","unstructured":"A. Nemirovsky and D. Yudin . Problem Complexity and Method Efficiency in Optimization . J. Wiley & Sons , New York , 1983 . A. Nemirovsky and D. Yudin. Problem Complexity and Method Efficiency in Optimization. J. Wiley & Sons, New York, 1983."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"Rockafellar R. T.","year":"1970","unstructured":"R. T. Rockafellar . Convex Analysis . Princeton University Press , 1970 . R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478909040097"},{"key":"e_1_3_2_1_41_1","volume-title":"On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization","author":"Tseng P.","year":"2008","unstructured":"P. Tseng . On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization , 2008 . P. Tseng. On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization, 2008."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296080"},{"key":"e_1_3_2_1_43_1","volume-title":"Algorithmic Game Theory","author":"Vazirani Vijay V.","year":"2007","unstructured":"Vijay V. Vazirani . Algorithmic Game Theory , chapter Combinatorial Algorithms for Market Equilibria. Cambridge University Press , 2007 . Vijay V. Vazirani. Algorithmic Game Theory, chapter Combinatorial Algorithms for Market Equilibria. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0450"},{"key":"e_1_3_2_1_45_1","volume-title":"ICS","author":"Vijay","year":"2010","unstructured":"Vijay V. Vazirani and Mihalis Yannakakis. Market equilibrium under separable, piecewise-linear, concave utilities . In ICS , 2010 . Vijay V. Vazirani and Mihalis Yannakakis. Market equilibrium under separable, piecewise-linear, concave utilities. In ICS, 2010."},{"key":"e_1_3_2_1_46_1","volume-title":"\u00c9l\u00e9ments d'\u00e9conomie politique pure ou th\u00e9orie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne","author":"Walras L.","year":"1874","unstructured":"L. Walras . \u00c9l\u00e9ments d'\u00e9conomie politique pure ou th\u00e9orie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne , Paris , 1874 . (1899, 4 th ed.; 1926, rev ed., 1954, Engl . transl.). L. Walras. \u00c9l\u00e9ments d'\u00e9conomie politique pure ou th\u00e9orie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne, Paris, 1874. (1899, 4th ed.; 1926, rev ed., 1954, Engl. transl.).","edition":"4"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250844"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0065-5"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_48"}],"event":{"name":"EC '11: ACM Conference on Electronic Commerce","location":"San Jose California USA","acronym":"EC '11","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 12th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993574.1993594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,5]]},"references-count":49,"alternative-id":["10.1145\/1993574.1993594","10.1145\/1993574"],"URL":"https:\/\/doi.org\/10.1145\/1993574.1993594","relation":{},"subject":[],"published":{"date-parts":[[2011,6,5]]},"assertion":[{"value":"2011-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}