{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:20:36Z","timestamp":1782778836956,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:00:00Z","timestamp":1725840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:00:00Z","timestamp":1725840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MaMu (NI 369\/19)"],"award-info":[{"award-number":["MaMu (NI 369\/19)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Research Training Group 2434 \u201cFacets of Complexity\u201d"],"award-info":[{"award-number":["Research Training Group 2434 \u201cFacets of Complexity\u201d"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["AFFA (BR 5207\/1; NI 369\/15)"],"award-info":[{"award-number":["AFFA (BR 5207\/1; NI 369\/15)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"OP VVV MEYS","award":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"]}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["Academic Research Fund Tier 2 (MOE2019-T2-1-045)"],"award-info":[{"award-number":["Academic Research Fund Tier 2 (MOE2019-T2-1-045)"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Talent Fund of Beijing Jiaotong University","award":["2023XKRC007"],"award-info":[{"award-number":["2023XKRC007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10458-024-09674-5","type":"journal-article","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:02:01Z","timestamp":1725854521000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multivariate algorithmics for eliminating envy by donating goods"],"prefix":"10.1007","volume":"38","author":[{"given":"Niclas","family":"Boehmer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"Heeger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junjie","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,9]]},"reference":[{"key":"9674_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H. (2021). Achieving envy-freeness and equitability with monetary transfers. In Proceedings of the thirty-fifth AAAI conference on artificial intelligence (AAAI \u201921) (pp. 5102\u20135109). AAAI Press.","DOI":"10.1609\/aaai.v35i6.16645"},{"key":"9674_CR2","unstructured":"Aziz, H., Schlotter, I., & Walsh, T. (2016). Control of fair division. In Proceedings of the twenty-fifth international joint conference on artificial intelligence (IJCAI \u201916) (pp. 67\u201373). IJCAI\/AAAI Press."},{"key":"9674_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.05.011","volume":"790","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Bir\u00f3, P., Lang, J., Lesca, J., & Monnot, J. (2019). Efficient reallocation under additive and responsive preferences. Theoretical Computer Science, 790, 1\u201315.","journal-title":"Theoretical Computer Science"},{"key":"9674_CR4","unstructured":"Aziz, H., Huang, X., Mattei, N., & Segal-Halevi, E. (2019b). The constrained round robin algorithm for fair and efficient allocation. CoRR, abs\/1908.00161."},{"issue":"2","key":"9674_CR5","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.ejor.2022.10.013","volume":"307","author":"H Aziz","year":"2023","unstructured":"Aziz, H., Huang, X., Mattei, N., & Segal-Halevi, E. (2023). Computing welfare-maximizing fair allocations of indivisible goods. European Journal of Operational Research, 307(2), 773\u2013784.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"9674_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/nav.3800030107","volume":"3","author":"R Bellman","year":"1956","unstructured":"Bellman, R. (1956). Notes on the theory of dynamic programming IV\u2014maximization over discrete sets. Naval Research Logistics Quarterly, 3(1\u20132), 67\u201370.","journal-title":"Naval Research Logistics Quarterly"},{"key":"9674_CR7","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Bukov, A., & Sagunov, D. (2024). Fair division with minimal withheld information in social networks. Theoretical Computer Science, 114446.","DOI":"10.1016\/j.tcs.2024.114446"},{"issue":"3","key":"9674_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/crq.3900130305","volume":"13","author":"SJ Brams","year":"1996","unstructured":"Brams, S. J., & Taylor, A. D. (1996). A procedure for divorce settlements. Mediation Quarterly, 13(3), 191\u2013205.","journal-title":"Mediation Quarterly"},{"issue":"2","key":"9674_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1090\/noti1075","volume":"61","author":"SJ Brams","year":"2014","unstructured":"Brams, S. J., Marc Kilgour, D., & Klamler, C. (2014). Two-person fair division of indivisible items: An efficient, envy-free algorithm. Notices of the American Mathematical Society, 61(2), 130\u2013141.","journal-title":"Notices of the American Mathematical Society"},{"key":"9674_CR10","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1613\/jair.1.15001","volume":"78","author":"R Bredereck","year":"2023","unstructured":"Bredereck, R., Kaczmarczyk, A., Luo, J., Niedermeier, R., & Sachse, F. (2023). Improving resource allocations by sharing in pairs. Journal of Artificial Intelligence Research, 78, 1069\u20131109.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9674_CR11","unstructured":"Bu, X., Li, Z., Liu, S., Song, J., & Tao, B. (2022). On the complexity of maximizing social welfare within fair allocations of indivisible goods. CoRR, abs\/2205.14296"},{"issue":"2","key":"9674_CR12","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.2016.1544","volume":"65","author":"E Budish","year":"2017","unstructured":"Budish, E., Cachon, G. P., Kessler, J. B., & Othman, A. (2017). Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Operations Research, 65(2), 314\u2013336.","journal-title":"Operations Research"},{"key":"9674_CR13","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., & Ioannidis, S. (2021). Computing envy-freeable allocations with limited subsidies. In Proceedings of 17th international conference on web and internet economics (WINE \u201921) (pp. 522\u2013539). Springer.","DOI":"10.1007\/978-3-030-94676-0_29"},{"key":"9674_CR14","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., & Huang, X. (2019a). Envy-freeness up to any item with high Nash welfare: The virtue of donating items. In Proceedings of the 2019 ACM conference on economics and computation (EC \u201919) (pp. 527\u2013545). ACM.","DOI":"10.1145\/3328526.3329574"},{"issue":"3","key":"9674_CR15","doi-asserted-by":"publisher","first-page":"12: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. (2019). The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3), 12:1-12:32.","journal-title":"ACM Transactions on Economics and Computation"},{"issue":"4","key":"9674_CR16","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/20M1359134","volume":"50","author":"BR Chaudhury","year":"2021","unstructured":"Chaudhury, B. R., Kavitha, T., Mehlhorn, K., & Sgouritsa, A. (2021). A little charity guarantees almost envy-freeness. SIAM Journal on Computing, 50(4), 1336\u20131358.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"9674_CR17","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1007\/s00453-020-00794-4","volume":"83","author":"B Dorn","year":"2021","unstructured":"Dorn, B., de Haan, R., & Schlotter, I. (2021). Obtaining a proportional allocation by deleting items. Algorithmica, 83(5), 1559\u20131603.","journal-title":"Algorithmica"},{"issue":"1 &2","key":"9674_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R. G., & Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for W. Theoretical Computer Science, 141(1 &2), 109\u2013131.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9674_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","volume":"28","author":"K Dudzi\u0144ski","year":"1987","unstructured":"Dudzi\u0144ski, K., & Walukiewicz, S. (1987). Exact methods for the knapsack problem and its generalizations. European Journal of Operational Research, 28(1), 3\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9674_CR20","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/3340322","volume":"16","author":"F Eisenbrand","year":"2020","unstructured":"Eisenbrand, F., & Weismantel, R. (2020). Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Transactions on Algorithms, 16(1), 5:1-5:14.","journal-title":"ACM Transactions on Algorithms"},{"key":"9674_CR21","unstructured":"Endriss, U. (2013). Reduction of economic inequality in combinatorial domains. In Proceedings of the 12th international conference on autonomous agents and multiagent systems (AAMAS \u201913) (pp. 175\u2013182). IFAAMAS."},{"issue":"1","key":"9674_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00453-020-00758-8","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Klute, F., & Ordyniak, S. (2021). On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica, 83(1), 297\u2013336.","journal-title":"Algorithmica"},{"key":"9674_CR23","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"key":"9674_CR24","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Lesca, J., & Wilczynski, A. (2017). Object allocation via swaps along a social network. In Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI \u201917) (pp. 213\u2013219). ijcai.org.","DOI":"10.24963\/ijcai.2017\/31"},{"key":"9674_CR25","doi-asserted-by":"crossref","unstructured":"Halpern, D., & Shah, N. (2019). Fair division with subsidy. In Proceedings of the 12th international symposium on algorithmic game theory (SAGT \u201919) (pp. 374\u2013389). Springer.","DOI":"10.1007\/978-3-030-30473-7_25"},{"key":"9674_CR26","doi-asserted-by":"crossref","unstructured":"Hosseini, H., Sikdar, S., Vaish, R., Wang, H., & Xia, L. (2020). Fair division through information withholding. In Proceedings of the thirty-fourth AAAI conference on artificial intelligence (AAAI \u201920) (pp. 2014\u20132021). AAAI Press.","DOI":"10.1609\/aaai.v34i02.5573"},{"key":"9674_CR27","doi-asserted-by":"crossref","unstructured":"Hosseini, H., Kavner, J., Was, T., & Xia, L. (2024). Distribution of chores with information asymmetry. In Proceedings of the 23th international conference on autonomous agents and multiagent systems (AAMAS \u201924) (page too appear). IFAAMAS.","DOI":"10.3233\/FAIA240901"},{"key":"9674_CR28","doi-asserted-by":"crossref","unstructured":"Karp, J., Kazachkov, A.\u00a0M., & Procaccia, A.\u00a0D. (2014). Envy-free division of sellable goods. In Proceedings of the twenty-eighth AAAI conference on artificial intelligence, July 27\u201331, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada (pp. 728\u2013734). AAAI Press.","DOI":"10.1609\/aaai.v28i1.8815"},{"key":"9674_CR29","doi-asserted-by":"crossref","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In Proceedings of a symposium on the complexity of computer computations, held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, The IBM Research Symposia Series (pp. 85\u2013103). Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9674_CR30","doi-asserted-by":"crossref","unstructured":"Narayan, V. V., Suzuki, M., & Vetta, A. (2021). Two birds with one stone: Fairness and welfare via transfers. In Proceedings of the 14th international symposium on algorithmic game theory (SAGT \u201921) (pp. 376\u2013390). Springer.","DOI":"10.1007\/978-3-030-85947-3_25"},{"issue":"3","key":"9674_CR31","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1287\/opre.2022.2279","volume":"70","author":"F Sandomirskiy","year":"2022","unstructured":"Sandomirskiy, F., & Halevi, S. (2022). Efficient fair division with minimal sharing. Operations Research, 70(3), 1762\u20131782.","journal-title":"Operations Research"},{"issue":"1","key":"9674_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s10458-022-09545-x","volume":"36","author":"E Segal-Halevi","year":"2022","unstructured":"Segal-Halevi, E. (2022). Redividing the cake. Autonomous Agents and Multi-Agent Systems, 36(1), 14.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"2","key":"9674_CR33","first-page":"46","volume":"19","author":"W Suksompong","year":"2021","unstructured":"Suksompong, W. (2021). Constraints in fair division. SIGecom. Exchange, 19(2), 46\u201361.","journal-title":"Exchange"},{"issue":"2","key":"9674_CR34","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10726-011-9263-5","volume":"22","author":"R Vetschera","year":"2013","unstructured":"Vetschera, R., & Kilgour, D. M. (2013). Strategic behavior in contested-pile methods for fair division of indivisible items. Group Decision and Negotiation, 22(2), 299\u2013319.","journal-title":"Group Decision and Negotiation"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09674-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-024-09674-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09674-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T15:24:19Z","timestamp":1731511459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-024-09674-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,9]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9674"],"URL":"https:\/\/doi.org\/10.1007\/s10458-024-09674-5","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,9]]},"assertion":[{"value":"9 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"43"}}