{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:21:04Z","timestamp":1751192464403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_23","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"402-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Nash Welfare Maximization Without Predictions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2963-9556","authenticated-orcid":false,"given":"Zhiyi","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-6237","authenticated-orcid":false,"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5481-6553","authenticated-orcid":false,"given":"Xinkai","family":"Shu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4919-0947","authenticated-orcid":false,"given":"Tianze","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. Math."},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Trans. Algorithms 2(4), 640\u2013660 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Anari, N., Mai, T., Gharan, S.O., Vazirani, V.V.: Nash social welfare for indivisible items under separable, piecewise-linear concave utilities. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2274\u20132290 (2018)","DOI":"10.1137\/1.9781611975031.147"},{"key":"23_CR4","unstructured":"Anari, N., Gharan, S.O., Saberi, A., Singh, M.: Nash social welfare, matrix permanent, and stable polynomials. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference, p. 36 (2017)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-15781-3_5","volume-title":"Algorithms \u2013 ESA 2010","author":"Y Azar","year":"2010","unstructured":"Azar, Y., Buchbinder, N., Jain, K.: How to allocate goods in an online market? In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 51\u201362. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15781-3_5"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Gkatzelis, V., Gorokh, A., Jin, B.: Online Nash social welfare maximization with predictions. In: Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201319 (2022)","DOI":"10.1137\/1.9781611977073.1"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Gkatzelis, V., Hossain, S., Jin, B., Micha, E., Shah, N.: Proportionally fair online allocation of public goods with predictions. arXiv preprint arXiv:2209.15305 (2022)","DOI":"10.24963\/ijcai.2023\/3"},{"key":"23_CR8","unstructured":"Barman, S., Bhaskar, U., Krishna, A., Sundaram, R.G.: Tight approximation algorithms for p-mean welfare under subadditive valuations. In: Proceedings of the 28th Annual European Symposium on Algorithms, pp. 11:1\u201311:17 (2020)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Barman, S., Khan, A., Maiti, A.: Universal and tight online algorithms for generalized-mean welfare. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 4793\u20134800 (2022)","DOI":"10.1609\/aaai.v36i5.20406"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 19th ACM Conference on Economics and Computation, pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","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":"23_CR12","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehta, R.: Fair and efficient allocations under subadditive valuations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 5269\u20135276 (2021)","DOI":"10.1609\/aaai.v35i6.16665"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., et al.: Convex program duality, Fisher markets, and Nash social welfare. In: Proceedings of the 18th ACM Conference on Economics and Computation, pp. 459\u2013460 (2017)","DOI":"10.1145\/3033274.3085109"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pp. 371\u2013380 (2015)","DOI":"10.1145\/2746539.2746589"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Monthly 68(1P1), 1\u201317 (1961)","DOI":"10.1080\/00029890.1961.11989615"},{"issue":"1","key":"23_CR17","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."},{"key":"23_CR18","unstructured":"Gao, Y., Peysakhovich, A., Kroer, C.: Online market equilibrium with application to fair division. In: Advances in Neural Information Processing Systems, vol. 34, pp. 27305\u201327318 (2021)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Garg, J., Hoefer, M., Mehlhorn, K.: Approximating the Nash social welfare with budget-additive valuations. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2326\u20132340 (2018)","DOI":"10.1137\/1.9781611975031.150"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Garg, J., Kulkarni, P., Kulkarni, R.: Approximating Nash social welfare under submodular valuations through (un)matchings. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2673\u20132687 (2020)","DOI":"10.1137\/1.9781611975994.163"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Gkatzelis, V., Psomas, A., Tan, X.: Fair and efficient online allocations with normalized valuations. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 5440\u20135447 (2021)","DOI":"10.1609\/aaai.v35i6.16685"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TNET.2016.2575779","volume":"25","author":"F Hao","year":"2016","unstructured":"Hao, F., Kodialam, M., Lakshman, T., Mukherjee, S.: Online allocation of virtual machines in a distributed cloud. IEEE\/ACM Trans. Networking 25(1), 238\u2013249 (2016)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"23_CR23","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge (1952)"},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.2307\/1914191","volume":"47","author":"M Kaneko","year":"1979","unstructured":"Kaneko, M., Nakamura, K.: The Nash social welfare function. Econometrica 47(2), 423\u2013435 (1979)","journal-title":"Econometrica"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2017.01.012","volume":"122","author":"E Lee","year":"2017","unstructured":"Lee, E.: APX-hardness of maximizing Nash social welfare with indivisible items. Inf. Process. Lett. 122, 17\u201320 (2017)","journal-title":"Inf. Process. Lett."},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Li, W., Vondr\u00e1k, J.: A constant-factor approximation algorithm for Nash social welfare with submodular valuations. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, pp. 25\u201336 (2022)","DOI":"10.1109\/FOCS52979.2021.00012"},{"key":"23_CR28","unstructured":"Liao, L., Gao, Y., Kroer, C.: Nonstationary dual averaging and online fair allocation. In: Advances in Neural Information Processing Systems, vol. 35, pp. 37159\u201337172 (2022)"},{"issue":"4","key":"23_CR29","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"23_CR30","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2004)"},{"issue":"2","key":"23_CR31","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"JF Nash Jr","year":"1950","unstructured":"Nash, J.F., Jr.: The bargaining problem. Econometrica 18(2), 155\u2013162 (1950)","journal-title":"Econometrica"},{"issue":"4","key":"23_CR32","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1257\/jep.31.4.145","volume":"31","author":"C Prendergast","year":"2017","unstructured":"Prendergast, C.: How food banks use markets to feed the poor. J. Econ. Perspect. 31(4), 145\u2013162 (2017)","journal-title":"J. Econ. Perspect."},{"issue":"1","key":"23_CR33","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Vazirani, V.V.: Combinatorial algorithms for market equilibria. In: Algorithmic Game Theory, pp. 103\u2013134. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.007"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48974-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:05:00Z","timestamp":1703988300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}