{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:48Z","timestamp":1759637808326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_1","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["EFX Under Budget Constraint"],"prefix":"10.1007","author":[{"given":"Sijia","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guichen","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boon Han","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A.: Maximum Nash welfare and other stories about EFX. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 24\u201330. IJCAI 2020, AAAI Press, Yokohama, Japan (2020)","DOI":"10.24963\/ijcai.2020\/4"},{"key":"1_CR2","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. EC 2018, ACM, New York, NY, USA (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"1_CR3","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Greedy algorithms for maximizing Nash social welfare. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 7\u201313. AAMAS 2018, ACM, Stockholm, Sweden (2018)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Biswas, A., Barman, S.: Fair division under cardinality constraints. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 91\u201397. IJCAI 2018, AAAI Press, Stockholm, Sweden (2018)","DOI":"10.24963\/ijcai.2018\/13"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., Huang, X.: Envy-freeness up to any item with high Nash welfare: The virtue of donating items. In: Proceedings of the 20th ACM Conference on Economics and Computation, pp. 527\u2013545. EC 2019, ACM, New York, NY, USA (2019)","DOI":"10.1145\/3328526.3329574"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput. 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 1\u201319. EC 2020, ACM, New York, NY, USA (2020)","DOI":"10.1145\/3391403.3399511"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/20M1359134","volume":"50","author":"BR Chaudhury","year":"2021","unstructured":"Chaudhury, B.R., Kavitha, T., Mehlhorn, K., Sgouritsa, A.: A little charity guarantees almost envy-freeness. SIAM J. Comput. 50(4), 1336\u20131358 (2021)","journal-title":"SIAM J. Comput."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Devanur, N., Gkatzelis, V., Jain, K., Mai, T., Vazirani, V.V., Yazdanbod, S.: Convex program duality, fisher markets, and Nash social welfare. In: Proceedings of the 18th ACM Conference on Economics and Computation, pp. 459\u2013460. EC 2017, ACM, New York, NY, USA (2017)","DOI":"10.1145\/3033274.3085109"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 371\u2013380. STOC 2015, ACM, New York, NY, USA (2015)","DOI":"10.1145\/2746539.2746589"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D.G., Halpern, J.Y., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Innovations in Theoretical Computer Science, pp. 68\u201375. ITCS 2012, ACM, New York, NY, USA (2012)","DOI":"10.1145\/2090236.2090243"},{"issue":"1","key":"1_CR12","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. Statist. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Statist."},{"key":"1_CR13","unstructured":"Gan, J., Li, B., Wu, X.: Approximately envy-free budget-feasible allocation (2021). https:\/\/arxiv.org\/abs\/2106.14446"},{"key":"1_CR14","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 2020 ACM-SIAM Symposium on Discrete Algorithms, pp. 2673\u20132687. SOSA 2020, SIAM, Salt Lake City, UT, USA (2020)","DOI":"10.1137\/1.9781611975994.163"},{"key":"1_CR15","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: Fair allocation of multiple resource types. In: Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, pp. 323\u2013336. NSDI 2011, USENIX Association, USA (2011)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., Akella, A.: Multi-resource packing for cluster schedulers. In: ACM SIGCOMM 2014 Conference, pp. 455\u2013466. SIGCOMM 2014, ACM, Chicago, IL, USA (2014)","DOI":"10.1145\/2619239.2626334"},{"issue":"2","key":"1_CR17","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":"1_CR18","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."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/s10878-020-00602-3","volume":"40","author":"P Li","year":"2020","unstructured":"Li, P., Hua, Q., Hu, Z., Ting, H.-F., Zhang, Y.: Approximation algorithms for the selling with preference. J. Combinat. Optim. 40(2), 366\u2013378 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00602-3","journal-title":"J. Combinat. Optim."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 125\u2013131. EC 2004, ACM, New York, NY, USA (2004)","DOI":"10.1145\/988772.988792"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair Division and Collective Welfare, vol. 1, 1st edn. MIT Press (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wu, X., Li, B., Gan, J.: Budget-feasible maximum Nash social welfare allocation is almost envy-free (2020). https:\/\/arxiv.org\/abs\/2012.03766","DOI":"10.24963\/ijcai.2021\/65"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2020.03.017","volume":"821","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Chin, F.Y., Poon, S.H., Ting, H.F., Xu, D., Yu, D.: Offline and online algorithms for single-minded selling problem. Theoret. Comput. Sci. 821, 15\u201322 (2020)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:46:08Z","timestamp":1672551968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}