{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:23:48Z","timestamp":1742952228336,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_12","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"207-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Good, the\u00a0Bad and\u00a0the\u00a0Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences"],"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":"12_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":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-021-09532-8","volume":"36","author":"H Aziz","year":"2022","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. Auton. Agent. Multi-Agent Syst. 36, 1\u201321 (2022)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"12_CR3","unstructured":"Aziz, H., Lindsay, J., Ritossa, A., Suzuki, M.: Fair allocation of two types of chores. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 143\u2013151 (2023)"},{"key":"12_CR4","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":"12_CR5","unstructured":"Barman, S., Narayan, V., Verma, P.: Fair chore division under binary supermodular costs. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2023)"},{"key":"12_CR6","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":"12_CR7","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":"12_CR8","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"},{"key":"12_CR9","unstructured":"Bhaskar, U., Sricharan, A.R., Vaish, R.: On approximate envy-freeness for indivisible chores and mixed resources. In: Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2021, pp. 1\u201323 (2021)"},{"issue":"6","key":"12_CR10","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":"12_CR11","unstructured":"B\u00e9rczi, K., et al.: Envy-free relaxations for goods, chores, and mixed items (2020)"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Cousins, C., Viswanathan, V., Zick, Y.: Dividing good and better items among agents with submodular valuations (WINE) (2023). https:\/\/doi.org\/10.48550\/ARXIV.2302.03087, https:\/\/arxiv.org\/abs\/2302.03087","DOI":"10.48550\/ARXIV.2302.03087"},{"key":"12_CR13","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":"12_CR14","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":"12_CR15","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":"12_CR16","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: Proceedings of the 16th Conference on Web and Internet Economics (WINE), pp. 370\u2013383 (2020)","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"12_CR17","unstructured":"Hosseini, H., Sikdar, S., Vaish, R., Xia, L.: Fairly dividing mixtures of goods and chores under lexicographic preferences. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2023)"},{"key":"12_CR18","unstructured":"Kulkarni, R., Mehta, R., Taki, S.: Approximating maximin shares with mixed manna. In: Proceedings of the 21st ACM Conference on Economics and Computation (EC) (2021)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Kulkarni, R., Mehta, R., Taki, S.: On the PTAs for maximin shares in an indivisible mixed manna. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pp. 5523\u20135530 (2021)","DOI":"10.1609\/aaai.v35i6.16695"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Shah, N.: Leximin allocations in the real world. ACM Trans. Econ. Comput. 6(34), 1\u201324 (2018)","DOI":"10.1145\/3274641"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM 65(2), 1\u201327 (2018)","DOI":"10.1145\/3140756"},{"key":"12_CR22","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":"12_CR23","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":"12_CR24","doi-asserted-by":"crossref","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, Inc. USA (1998). ISBN 047155894X","DOI":"10.1002\/9781118033142"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: A general framework for fair allocation under matroid rank valuations. In: Proceedings of the 24th ACM Conference on Economics and Computation (EC) (2023)","DOI":"10.1145\/3580507.3597675"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: Weighted notions of fairness with binary supermodular chores. arXiv preprint arXiv:2303.06212 (2023)","DOI":"10.2139\/ssrn.4388497"},{"key":"12_CR27","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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:03:36Z","timestamp":1703988216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_12","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)"}}]}}