{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:41:10Z","timestamp":1743054070663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_6","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"67-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Earning Limits in Fisher Markets with\u00a0Spending-Constraint Utilities"],"prefix":"10.1007","author":[{"given":"Xiaohui","family":"Bei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jugal","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"6_CR1","unstructured":"Anari, N., Mai, T., Gharan, S.O., Vazirani, V.: Nash social welfare for indivisible items under separable, piecewise-linear concave utilities (2016). CoRR abs\/1612.05191"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bei, X., Garg, J., Hoefer, M.: Ascending-price algorithms for unknown markets. In: Proceedings of 17th Conference Economics and Computation (EC), p. 699 (2016)","DOI":"10.1145\/2940716.2940765"},{"key":"6_CR3","unstructured":"Bei, X., Garg, J., Hoefer, M., Mehlhorn, K.: Computing equilibria in markets with budget-additive utilities. In: Proceedings of 24th European Symposium Algorithms (ESA), pp. 8:1\u20138:14 (2016)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Birnbaum, B., Devanur, N., Xiao, L.: Distributed algorithms via gradient descent for Fisher markets. In: Proceedings of 12th Conference Electronic Commerce (EC), pp. 127\u2013136 (2011)","DOI":"10.1145\/1993574.1993594"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Devanur, N., Gkatzelis, V., Jain, K., Mai, T., Vazirani, V., Yazdanbod, S.: Convex program duality, Fisher markets, and Nash social welfare. In: Proceedings of 18th Conference Economics and Computation (EC) (2017, to appear)","DOI":"10.1145\/3033274.3085109"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. In: Proceedings of 47th Symposium Theory of Computing (STOC), pp. 371\u2013380 (2015)","DOI":"10.1145\/2746539.2746589"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/1411509.1411512","volume":"55","author":"N Devanur","year":"2008","unstructured":"Devanur, N., Papadimitriou, C., Saberi, A., Vazirani, V.: Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5), 22:1\u201322:18 (2008)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N., Vazirani, V.: The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. In: Proceedings of 36th Symposium Theory of Computing (STOC), pp. 519\u2013528 (2004)","DOI":"10.1145\/1007352.1007431"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ic.2014.12.009","volume":"243","author":"R Duan","year":"2015","unstructured":"Duan, R., Mehlhorn, K.: A combinatorial polynomial algorithm for the linear Arrow-Debreu market. Inf. Comput. 243, 112\u2013132 (2015)","journal-title":"Inf. Comput."},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the Pari-Mutuel method. Ann. Math. Stat. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D. S. Hochbaum","year":"1990","unstructured":"Hochbaum, D., Shanthikumar, G.: Convex separable optimization is not much harder than linear optimization. J. ACM 37(4), 843\u2013862 (1990)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/S0097539705447384","volume":"37","author":"K Jain","year":"2007","unstructured":"Jain, K.: A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. SIAM J. Comput. 37(1), 306\u2013318 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/S0097539794263695","volume":"26","author":"A Karzanov","year":"1997","unstructured":"Karzanov, A., McCormick, T.: Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J. Comput. 26(4), 1245\u20131275 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Orlin, J.: Improved algorithms for computing Fisher\u2019s market clearing prices. In: Proceedings of 42nd Symposium Theory of Computing (STOC), pp. 291\u2013300 (2010)","DOI":"10.1145\/1806689.1806731"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1134\/S1990478909040097","volume":"3","author":"V Shmyrev","year":"2009","unstructured":"Shmyrev, V.: An algorithm for finding equilibrium in the linear exchange model with fixed budgets. J. Appl. Indust. Math. 3(4), 505\u2013518 (2009)","journal-title":"J. Appl. Indust. Math."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/moor.1100.0450","volume":"35","author":"V Vazirani","year":"2010","unstructured":"Vazirani, V.: Spending constraint utilities with applications to the adwords market. Math. Oper. Res. 35(2), 458\u2013478 (2010)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/moor.2013.0623","volume":"39","author":"L V\u00e9gh","year":"2014","unstructured":"V\u00e9gh, L.: Concave generalized flows with applications to market equilibria. Math. Oper. Res. 39(2), 573\u2013596 (2014)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1137\/140978296","volume":"45","author":"L V\u00e9gh","year":"2016","unstructured":"V\u00e9gh, L.: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. SIAM J. Comput. 45(5), 1729\u20131761 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"6_CR19","first-page":"315","volume":"111","author":"Y Ye","year":"2008","unstructured":"Ye, Y.: A path to the Arrow-Debreu competitive market equilibrium. Math. Prog. 111(1\u20132), 315\u2013348 (2008)","journal-title":"Math. Prog."},{"issue":"24","key":"6_CR20","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.1016\/j.tcs.2010.06.021","volume":"412","author":"L Zhang","year":"2011","unstructured":"Zhang, L.: Proportional response dynamics in the Fisher market. Theoret. Comput. Sci. 412(24), 2691\u20132698 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:25:58Z","timestamp":1709828758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}