{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:24:38Z","timestamp":1760300678330,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030946753"},{"type":"electronic","value":"9783030946760"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_21","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"373-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paritosh","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Anari, N., Gharan, S.O., Mai, T., 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 (SODA), pp. 2274\u20132290 (2018)","DOI":"10.1137\/1.9781611975031.147"},{"key":"21_CR2","unstructured":"Anari, N., Gharan, S.O., Saberi, A., Singh, M.: Nash social welfare, matrix permanent, and stable polynomials. In: Proceedings of the 8th Conference on Innovations in Theoretical Computer Science (ITCS) (2017)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35. AAAI (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"21_CR4","unstructured":"Barman, S., Bhaskar, U., Krishna, A., Sundaram, R.G.: Tight approximation algorithms for p-mean welfare under subadditive valuations. In: 28th Annual European Symposium on Algorithms (ESA 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Biswas, A., Krishnamurthy, S., Narahari, Y.: Groupwise maximin fair allocation of indivisible goods. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"21_CR7","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 (2018)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Barman, S., Verma, P.: Approximating nash social welfare under binary XOS and binary subadditive valuations. CoRR abs\/2106.02656 (2021)","DOI":"10.1007\/978-3-030-94676-0_21"},{"key":"21_CR9","unstructured":"Barman, S., Verma, P.: Existence and computation of maximin fair allocations under matroid-rank valuations. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 169\u2013177. AAMAS \u201921 (2021)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Bei, X., Garg, J., Hoefer, M., Mehlhorn, K.: Earning limits in fisher markets with spending-constraint utilities. In: Proceedings of the International Symposium on Algorithmic Game Theory (SAGT), pp. 67\u201379 (2017)","DOI":"10.1007\/978-3-319-66700-3_6"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Benabbou, N., Chakraborty, M., Igarashi, A., Zick, Y.: Finding fair and efficient allocations when valuations don\u2019t add up. In: International Symposium on Algorithmic Game Theory, pp. 32\u201346. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-57980-7_3","DOI":"10.1007\/978-3-030-57980-7_3"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Bogomolnaia, A., Moulin, H., Stong, R.: Collective choice under dichotomous preferences. J. Econ. Theory 122(2), 165\u2013184 (2005)","DOI":"10.1016\/j.jet.2004.05.005"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","DOI":"10.1613\/jair.2467"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi-Agent Syst. 30(2), 259\u2013290 (2016)","DOI":"10.1007\/s10458-015-9287-3"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","DOI":"10.1086\/664613"},{"key":"21_CR16","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. AAAI (2021)","DOI":"10.1609\/aaai.v35i6.16665"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Inapproximability results for bounded variants of optimization problems. In: International Symposium on Fundamentals of Computation Theory, pp. 27\u201338. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45077-1_4","DOI":"10.1007\/978-3-540-45077-1_4"},{"key":"21_CR18","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 2017 ACM Conference on Economics and Computation, pp. 459\u2013460 (2017)","DOI":"10.1145\/3033274.3085109"},{"key":"21_CR19","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 (2015)","DOI":"10.1145\/2746539.2746589"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Darmann, A., Schauer, J.: Maximizing Nash product social welfare in allocating indivisible goods. European J. Oper. Res. 247(2), 548\u2013559 (2015)","DOI":"10.1016\/j.ejor.2015.05.071"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper. Res. 35(1), 1\u201313 (2010)","DOI":"10.1287\/moor.1090.0436"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201906, Association for Computing Machinery, pp. 41\u201350. New York, NY, USA (2006)","DOI":"10.1145\/1132516.1132523"},{"key":"21_CR23","unstructured":"Freitas, G.: Combinatorial assignment under dichotomous preferences (2010)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Garg, J., Hoefer, M., Mehlhorn, K.: Approximating the Nash social welfare with budget-additive valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2326\u20132340. SIAM (2018)","DOI":"10.1137\/1.9781611975031.150"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Garg, J., Husi\u0107, E., V\u00e9gh, L.A.: Approximating Nash social welfare under Rado valuations. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1412\u20131425 (2021)","DOI":"10.1145\/3406325.3451031"},{"key":"21_CR26","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 fourteenth annual ACM-SIAM symposium on discrete algorithms, pp. 2673\u20132687. SIAM (2020)","DOI":"10.1137\/1.9781611975994.163"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 379\u2013380 (2020)","DOI":"10.1145\/3391403.3399526"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: improvements and generalizations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 539\u2013556 (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Goldman, J., Procaccia, A.D.: Spliddit: unleashing fair division algorithms. ACM SIGecom Exchanges 13(2), 41\u201346 (2015)","DOI":"10.1145\/2728732.2728738"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. In: International Conference on Web and Internet Economics, pp. 370\u2013383. Springer (2020)","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Shah, N.: Leximin allocations in the real world. ACM Trans. Econ. Comput. (TEAC) 6(3\u20134), 1\u201324 (2018)","DOI":"10.1145\/3274641"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: When can the maximin share guarantee be guaranteed? In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 523\u2013529 (2016)","DOI":"10.1609\/aaai.v30i1.10041"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Lee, E.: Apx-hardness of maximizing Nash social welfare with indivisible items. Inf. Proc. Lett. 122, 17\u201320 (2017)","DOI":"10.1016\/j.ipl.2017.01.012"},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Milgrom, P., Segal, I.: Economics and computer science of a radio spectrum reallocation. Proc. National Acad. Sci. 114(28), 7202\u20137209 (2017)","DOI":"10.1073\/pnas.1701997114"},{"key":"21_CR35","unstructured":"Li, W., Vondr\u00e1k, J.: A constant-factor approximation algorithm for Nash social welfare with submodular valuations. arXiv preprint arXiv:2103.10536 (2021)"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Li, Z., Vetta, A.: The fair division of hereditary set systems. ACM Trans. Econ. Comput. (TEAC) 9(2), 1\u201319 (2021)","DOI":"10.1145\/3434410"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair division and collective welfare. MIT press (2004)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"issue":"2","key":"21_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J.: The bargaining problem. Econometrica 18(2), 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic game theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"21_CR40","doi-asserted-by":"crossref","unstructured":"Ortega, J.: Multi-unit assignment under dichotomous preferences. Math. Soc. Sci. 103, 15\u201324 (2020)","DOI":"10.1016\/j.mathsocsci.2019.11.003"},{"key":"21_CR41","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the fifteenth ACM conference on Economics and computation, pp. 675\u2013692 (2014)","DOI":"10.1145\/2600057.2602835"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Pairwise kidney exchange. J. Econ. Theory 125(2), 151\u2013188 (2005)","DOI":"10.1016\/j.jet.2005.04.004"},{"key":"21_CR43","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency, vol. 24. Springer Science and Business Media (2003)"}],"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-030-94676-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T22:13:29Z","timestamp":1674512009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_21","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":"20 January 2022","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":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"146","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":"41","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":"11","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":"28% - 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.07","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":"7","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic","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)"}}]}}