{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:08:20Z","timestamp":1780711700147,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T00:00:00Z","timestamp":1418947200000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00453-014-9964-7","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T07:37:08Z","timestamp":1418974628000},"page":"589-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["How to Allocate Goods in an Online Market?"],"prefix":"10.1007","volume":"74","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Buchbinder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamal","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,19]]},"reference":[{"key":"9964_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/1907353","volume":"22","author":"K Arrow","year":"1954","unstructured":"Arrow, K., Debreu, G.: Existence of an equilibrium for competitive economy. Econometrica 22, 265\u2013290 (1954)","journal-title":"Econometrica"},{"issue":"3","key":"9964_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"9964_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the lp norm. In: Proceedings of 36th FOCS, pp. 383\u2013391 (1995)","DOI":"10.1109\/SFCS.1995.492494"},{"issue":"5","key":"9964_CR4","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/1183907.1183913","volume":"53","author":"A Blum","year":"2006","unstructured":"Blum, A., Sandholm, T., Zinkevich, M.: Online algorithms for market clearing. J. ACM 53(5), 845\u2013879 (2006)","journal-title":"J. ACM"},{"key":"9964_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"9964_CR6","unstructured":"Brainard, W.C., Scarf, H.E.: How to compute equilibrium prices in 1891. In: Cowles Foundations Discussion paper, p. 1270 (2000)"},{"key":"9964_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Jain, K., Naor, J.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: ESA \u201907: Proceedings of the 15th Annual European Symposium, pp. 253\u2013264 (2007)","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"9964_CR8","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2","key":"9964_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"key":"9964_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1561\/0400000024","volume":"3","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: The design of competitive online algorithms via a primal-dual approach. Found. Trends Theor. Comput. Sci. 3, 93\u2013263 (2009)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9964_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Devanur, N.R., Vazirani, V.V.: New results on rationality and strongly polynomial time solvability in eisenberg-gale markets. In: WINE, pp. 239\u2013250 (2006)","DOI":"10.1007\/11944874_22"},{"key":"9964_CR12","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Kannan, R.: Market equilibria in polynomial time for fixed number of goods or agents. In: FOCS, pp. 45\u201353 (2008)","DOI":"10.1109\/FOCS.2008.30"},{"issue":"5","key":"9964_CR13","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1411509.1411512","volume":"55","author":"NR Devanur","year":"2008","unstructured":"Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5), 22 (2008)","journal-title":"J. ACM"},{"issue":"4","key":"9964_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1287\/mnsc.7.4.337","volume":"7","author":"E Eisenberg","year":"1961","unstructured":"Eisenberg, E.: Aggregation of utility functions. Manag. Sci. 7(4), 337\u2013350 (1961)","journal-title":"Manag. Sci."},{"key":"9964_CR15","doi-asserted-by":"crossref","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. Annu. Math. Stat. 30, 165\u2013168 (1959)","journal-title":"Annu. Math. Stat."},{"key":"9964_CR16","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Eisenberg-gale markets: algorithms and structural properties. In: STOC \u201907: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 364\u2013373 (2007)","DOI":"10.1145\/1250790.1250845"},{"key":"9964_CR17","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Saberi, A.: Multi-unit auctions with unknown supply. In: EC \u201906: Proceedings of the 7th ACM Conference on Electronic commerce, pp. 243\u2013249 (2006)","DOI":"10.1145\/1134707.1134734"},{"issue":"5","key":"9964_CR18","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)","journal-title":"J. ACM"},{"key":"9964_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"9964_CR20","doi-asserted-by":"crossref","unstructured":"Scarf, H.: The computation of economic equilibria (with collaboration of t. hansen). In: Cowles Foundation Monograph No. 24 (1973)","DOI":"10.1057\/978-1-349-95189-5_451"},{"issue":"3","key":"9964_CR21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s11134-006-0067-2","volume":"54","author":"AL Stolyar","year":"2006","unstructured":"Stolyar, A.L.: Greedy primal-dual algorithm for dynamic resource allocation in complex networks. Queueing Syst. Theory Appl. 54(3), 203\u2013220 (2006)","journal-title":"Queueing Syst. Theory Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9964-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9964-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9964-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T11:59:40Z","timestamp":1747223980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9964-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,19]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9964"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9964-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,19]]}}}