{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T22:08:46Z","timestamp":1778450926881,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032186591","type":"print"},{"value":"9783032186607","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-18660-7_25","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T22:07:04Z","timestamp":1778450824000},"page":"467-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair and\u00a0Efficient Allocation of\u00a0Indivisible Mixed Manna"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Vishwa Prakash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditi","family":"Sethia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mashbat","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-58285-2_1","volume-title":"KI 2020: Advances in Artificial Intelligence","author":"M Aleksandrov","year":"2020","unstructured":"Aleksandrov, M., Walsh, T.: Two algorithms for additive and fair division of mixed manna. In: Schmid, U., Kl\u00fcgl, F., Wolter, D. (eds.) KI 2020. LNCS (LNAI), vol. 12325, pp. 3\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58285-2_1"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"3","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), 3 (2022)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lindsay, J., Ritossa, A., Suzuki, M.: Fair allocation of two types of chores. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, Aamas 2023, pp. 143\u2013151. International Foundation for Autonomous Agents and Multiagent Systems, London, United Kingdom and Richland, SC (2023)","DOI":"10.65109\/FCUW6659"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Barbanel, J.B.: The Geometry of Efficient Fair Division. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511546679"},{"key":"25_CR5","unstructured":"Barman, S., HV, V., Sethia, A., Suzuki, M.: Fair and efficient allocation of indivisible mixed manna. arXiv preprint arXiv:2507.03946 (2025)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. EC 2018, pp. 557\u2013574. Association for Computing Machinery, New York (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"25_CR7","unstructured":"Bhaskar, U., Sricharan, A.R., Vaish, R.: On approximate envy-freeness for indivisible chores and mixed resources. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, August 16-18, 2021, University of Washington, Seattle, USA. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.3982\/ECTA14564","volume":"85","author":"A Bogomolnaia","year":"2017","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E.: Competitive division of a mixed manna. Econometrica 85(6), 1847\u20131871 (2017)","journal-title":"Econometrica"},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake-Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution, 1st edn. Cambridge University Press, Cambridge (1996)","edition":"1"},{"key":"25_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice, 1st edn. Cambridge University Press, Cambridge (2016)","edition":"1"},{"issue":"6","key":"25_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."},{"issue":"3","key":"25_CR12","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":"25_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-04428-1_9","volume-title":"Algorithmic Decision Theory","author":"B de Keijzer","year":"2009","unstructured":"de Keijzer, B., Bouveret, S., Klos, T., Zhang, Y.: On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 98\u2013110. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_9"},{"key":"25_CR14","doi-asserted-by":"crossref","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 Multiagent Systems. Aamas 2022, pp. 372\u2013380. International Foundation for Autonomous Agents and Multiagent Systems, Virtual Event, New Zealand and Richland, SC (2022)","DOI":"10.65109\/PGYF2278"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Eckart, O., Psomas, A., Verma, P.: On the fairness of normalized p-means for allocating goods and chores. In: Proceedings of the 25th ACM Conference on Economics and Computation, pp. 1267\u20131267 (2024)","DOI":"10.1145\/3670865.3673445"},{"issue":"1","key":"25_CR16","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Fair and efficient allocations of chores under bivalued preferences. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 5, pp. 5043\u20135050 (2022)","DOI":"10.1609\/aaai.v36i5.20436"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: New algorithms for the fair and efficient allocation of indivisible chores. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pp. 2710\u20132718. International Joint Conferences on Artificial Intelligence Organization, Macau, SAR China (2023)","DOI":"10.24963\/ijcai.2023\/302"},{"key":"25_CR19","unstructured":"Garg, J., Murhekar, A., Qin, J.: Weighted EF1 and PO allocations with few types of agents or chores. In: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, pp. 2799\u20132806. International Joint Conferences on Artificial Intelligence Organization, Jeju, South Korea (Aug 2024)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Constant-factor efx exists for chores. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC 2025, pp. 1580\u20131589. Association for Computing Machinery, New York (2025)","DOI":"10.1145\/3717823.3718305"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Meunier, F.: Fair and efficient allocation of indivisible items under category constraints. CoRR abs\/2503.20260 (2025)","DOI":"10.2139\/ssrn.5396264"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"132","DOI":"10.4064\/fm-14-1-132-137","volume":"14","author":"B Knaster","year":"1929","unstructured":"Knaster, B., Kuratowski, C., Mazurkiewicz, S.: Ein Beweis des Fixpunktsatzes f\u00fcr n-dimensionale Simplexe. Fundam. Math. 14, 132\u2013137 (1929)","journal-title":"Fundam. Math."},{"key":"25_CR23","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 Electronic Commerce, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"25_CR24","unstructured":"Mahara, R.: A polynomial-time algorithm for fair and efficient allocation with a fixed number of agents. arXiv preprint arXiv:2411.01810 (2024)"},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2003","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)"},{"issue":"3","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1287\/opre.2022.2279","volume":"70","author":"F Sandomirskiy","year":"2022","unstructured":"Sandomirskiy, F., Segal-Halevi, E.: Efficient fair division with minimal sharing. Oper. Res. 70(3), 1762\u20131782 (2022)","journal-title":"Oper. Res."},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Shoshan, H., Hazon, N., Segal-Halevi, E.: Efficient nearly-fair division with capacity constraints. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems. AAMAS 2023, pp. 206\u2013214. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2023)","DOI":"10.65109\/KVXG2484"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"25_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-4068(85)90023-0","volume":"14","author":"D Weller","year":"1985","unstructured":"Weller, D.: Fair division of a measurable space. J. Math. Econ. 14(1), 5\u201317 (1985)","journal-title":"J. Math. Econ."},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhou, S.: Weighted EF1 allocations for indivisible chores. In: Proceedings of the 24th ACM Conference on Economics and Computation, pp. 1155\u20131155. ACM, London (2023)","DOI":"10.1145\/3580507.3597763"}],"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-032-18660-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T22:07:06Z","timestamp":1778450826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-18660-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032186591","9783032186607"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-18660-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","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":"New Brunswick, NJ","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2025.cs.rutgers.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}