{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T07:19:01Z","timestamp":1745306341547,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031228315"},{"type":"electronic","value":"9783031228322"}],"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-22832-2_15","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"256-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nash Welfare Guarantees for\u00a0Fair and\u00a0Efficient Coverage"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[]},{"given":"Anand","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Narahari","sequence":"additional","affiliation":[]},{"given":"Soumyarup","family":"Sadhukhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"15_CR1","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, pp. 5119\u20135126 (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"15_CR2","unstructured":"Baghel, D.K., Levit, V.E., Segal-Halevi, E.: Fair division algorithms for electricity distribution. arXiv preprint arXiv:2205.14531 (2022)"},{"key":"15_CR3","unstructured":"Barman, S., Fawzi, O., Ferm\u00e9, P.: Tight approximation guarantees for concave coverage problems. In: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). pp. 9:1\u20139:17 (2021)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishna, A., Narahari, Y., Sadhukhan, S.: Nash welfare guarantees for fair and efficient coverage (2022)","DOI":"10.1007\/978-3-031-22832-2_15"},{"key":"15_CR5","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":"15_CR6","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)"},{"issue":"3","key":"15_CR7","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":"15_CR8","doi-asserted-by":"publisher","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 629\u2013646. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3033274.3085125, https:\/\/doi.org\/10.1145\/3033274.3085125","DOI":"10.1145\/3033274.3085125"},{"issue":"8","key":"15_CR9","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Exceptional paper - location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manage. Sci. 23(8), 789\u2013810 (1977)","journal-title":"Manage. Sci."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Fain, B., Munagala, K., Shah, N.: Fair allocation of indivisible public goods. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 575\u2013592 (2018)","DOI":"10.1145\/3219166.3219174"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Fluschnik, T., Skowron, P., Triphaus, M., Wilker, K.: Fair knapsack. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1941\u20131948 (2019)","DOI":"10.1609\/aaai.v33i01.33011941"},{"key":"15_CR13","unstructured":"Garg, J., Kulkarni, P., Murhekar, A.: On fair and efficient allocations of indivisible public goods. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 22:1\u201322:19 (2021)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-64946-3_1","volume-title":"Web and Internet Economics","author":"S Gollapudi","year":"2020","unstructured":"Gollapudi, S., Kollias, K., Plaut, B.: Almost envy-free repeated matching in\u00a0two-sided markets. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 3\u201316. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_1"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-64946-3_26","volume-title":"Web and Internet Economics","author":"D Halpern","year":"2020","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 370\u2013383. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_26"},{"key":"15_CR16","unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94\u2013143. PWS Publishing Company, Boston (1996)"},{"key":"15_CR17","unstructured":"Kell, N., Sun, K.: Approximations for allocating indivisible items with concave additive valuations. arXiv preprint arxiv:2109.00081 (2021), https:\/\/arxiv.org\/abs\/2109.00081"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kicillof, N., Grieskamp, W., Tillmann, N., Braberman, V.: Achieving both model and code coverage with automated gray-box testing. In: Proceedings of the 3rd International Workshop on Advances in Model-based Testing, pp. 1\u201311 (2007)","DOI":"10.1145\/1291535.1291536"},{"key":"15_CR19","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 (FOCS), pp. 25\u201336. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00012"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Marden, J.R., Wierman, A.: Distributed welfare games with applications to sensor coverage. In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, 9-11 December 2008, Canc\u00fan, Mexico. pp. 1708\u20131713. IEEE (2008). https:\/\/doi.org\/10.1109\/CDC.2008.4738800, https:\/\/doi.org\/10.1109\/CDC.2008.4738800","DOI":"10.1109\/CDC.2008.4738800"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, London (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-019-09428-8","volume":"34","author":"OI Oluwasuji","year":"2020","unstructured":"Oluwasuji, O.I., Malik, O., Zhang, J., Ramchurn, S.D.: Solving the fair electric load shedding problem in developing countries. Auton. Agent. Multi-agent Syst. 34(1), 1\u201335 (2020)","journal-title":"Auton. Agent. Multi-agent Syst."},{"key":"15_CR23","unstructured":"Rosenfeld, A., Talmon, N.: What should we optimize in participatory budgeting? an experimental study. arXiv preprint arXiv:2111.07308 (2021)"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/s10288-004-0035-9","DOI":"10.1007\/s10288-004-0035-9"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"S\u00fchr, T., Biega, A.J., Zehlike, M., Gummadi, K.P., Chakraborty, A.: Two-sided fairness for repeated matchings in two-sided markets: a case study of a ride-hailing platform. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2019, pp. 3082\u20133092. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3292500.3330793, https:\/\/doi.org\/10.1145\/3292500.3330793","DOI":"10.1145\/3292500.3330793"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Approximation Algorithms, vol. 1. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7","DOI":"10.1007\/978-3-662-04565-7"}],"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-22832-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:27Z","timestamp":1710269307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_15","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":"9 December 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":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","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":"126","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":"15% - 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":"6","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":"19 abstracts in the back matter","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)"}}]}}