{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:03:12Z","timestamp":1743015792682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"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_13","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"225-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dividing Good and\u00a0Great Items Among Agents with\u00a0Bivalued Submodular Valuations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1691-0282","authenticated-orcid":false,"given":"Cyrus","family":"Cousins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6261-6228","authenticated-orcid":false,"given":"Vignesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-6230","authenticated-orcid":false,"given":"Yair","family":"Zick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Akrami, H., et al.: Maximizing Nash social welfare in 2-value instances. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI) (2022)","DOI":"10.1609\/aaai.v36i5.20402"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Akrami, H., et al.: Maximizing Nash social welfare in 2-value instances: the half-integer case. CoRR abs\/2207.10949 (2022)","DOI":"10.1609\/aaai.v36i5.20402"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2021.02.020","volume":"863","author":"G Amanatidis","year":"2021","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A.: Maximum Nash welfare and other stories about EFX. Theor. Comput. Sci. 863, 69\u201385 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Li, B., Moulin, H., Wu, X.: Algorithmic fair allocation of indivisible items: a survey and new questions. CoRR abs\/2202.08713 (2022)","DOI":"10.1145\/3572885.3572887"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pp. 5119\u20135126 (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"13_CR6","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 (ESA), pp. 11:1\u201311:17 (2020)"},{"key":"13_CR7","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 Multi-Agent Systems (AAMAS), pp. 169\u2013177 (2021)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Barman, S., Verma, P.: Truthful and fair mechanisms for matroid-rank valuations. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI) (2022)","DOI":"10.1609\/aaai.v36i5.20407"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Chakraborty, M., Elkind, E., Zick, Y.: Fairness towards groups of agents in the allocation of indivisible items. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 95\u2013101 (2019)","DOI":"10.24963\/ijcai.2019\/14"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Chakraborty, M., Igarashi, A., Zick, Y.: Finding fair and efficient allocations for matroid rank valuations. ACM Trans. Econ. Comput. 9(4) (2021)","DOI":"10.1145\/3485006"},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 17th ACM Conference on Economics and Computation (EC), pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. ACM Trans. Econ. Comput. 9 (2021)","DOI":"10.1145\/3457166"},{"key":"13_CR14","unstructured":"Cousins, C.: An axiomatic theory of provably-fair welfare-centric machine learning. In: Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS), pp. 16610\u201316621 (2021)"},{"key":"13_CR15","unstructured":"Cousins, C.: Bounds and applications of concentration of measure in fair machine learning and data science. Ph.D. thesis, Brown University (2021)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Cousins, C.: Uncertainty and the social planners problem: why sample complexity matters. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency (2022)","DOI":"10.1145\/3531146.3533243"},{"key":"13_CR17","unstructured":"Cousins, C.: Revisiting fair-PAC learning and the axioms of cardinal welfare. In: Artificial Intelligence and Statistics (AISTATS) (2023)"},{"key":"13_CR18","unstructured":"Ebadian, S., Peters, D., Shah, N.: How to fairly allocate easy and difficult chores. In: Proceedings of the 21st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 372\u2013380 (2022)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-85947-3_23","volume-title":"Algorithmic Game Theory","author":"J Garg","year":"2021","unstructured":"Garg, J., Murhekar, A.: Computing fair and efficient allocations with few utility values. In: Caragiannis, I., Hansen, K.A. (eds.) SAGT 2021. LNCS, vol. 12885, pp. 345\u2013359. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85947-3_23"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Fair and efficient allocations of chores under bivalued preferences. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI) (2022)","DOI":"10.1609\/aaai.v36i5.20436"},{"key":"13_CR21","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 19th ACM Conference on Economics and Computation (EC), pp. 539\u2013556 (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"13_CR22","unstructured":"Heidari, H., Ferrari, C., Gummadi, K., Krause, A.: Fairness behind a veil of ignorance: a welfare analysis for automated decision making. In: Advances in Neural Information Processing Systems, pp. 1265\u20131276 (2018)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Shah, N.: Leximin allocations in the real world. ACM Trans. Econ. Comput. 6(34) (2018)","DOI":"10.1145\/3274641"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Economics and Computation (EC), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"13_CR25","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":"13_CR26","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discret. Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 675\u2013692 (2014)","DOI":"10.1145\/2600057.2602835"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: A general framework for fair allocation with matroid rank valuations. In: Proceedings of the 24th ACM Conference on Economics and Computation (EC) (2023)","DOI":"10.1145\/3580507.3597675"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: Yankee swap: a fast and simple fair allocation mechanism for matroid rank valuations. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2023)","DOI":"10.1145\/3580507.3597675"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:03:27Z","timestamp":1703988207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_13","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)"}}]}}