{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:50:36Z","timestamp":1771548636675,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20221-0001"],"award-info":[{"award-number":["MOE-T2EP20221-0001"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BR 4744\/2-1"],"award-info":[{"award-number":["BR 4744\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100030716","name":"Centro de Modelamiento Matem\u00e1tico","doi-asserted-by":"publisher","award":["FB210005"],"award-info":[{"award-number":["FB210005"]}],"id":[{"id":"10.13039\/100030716","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ANID-Chile","award":["ACT210005"],"award-info":[{"award-number":["ACT210005"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1928930"],"award-info":[{"award-number":["DMS-1928930"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["G-2021-16778"],"award-info":[{"award-number":["G-2021-16778"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We investigate the fair allocation of indivisible goods to agents with possibly different entitlements represented by weights. Previous work has shown that guarantees for additive valuations with existing envy-based notions cannot be extended to the case where agents have matroid-rank (i.e., binary submodular) valuations. We propose two families of envy-based notions for matroid-rank and general submodular valuations, one based on the idea of transferability and the other on marginal values. We show that our notions can be satisfied via generalizations of rules such as picking sequences and maximum weighted Nash welfare. In addition, we introduce welfare measures based on harmonic numbers, and show that variants of maximum weighted harmonic welfare offer stronger fairness guarantees than maximum weighted Nash welfare under matroid-rank valuations.<\/jats:p>","DOI":"10.1007\/s00355-025-01599-6","type":"journal-article","created":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:19:06Z","timestamp":1744867146000},"page":"983-1016","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted envy-freeness for submodular valuations"],"prefix":"10.1007","volume":"65","author":[{"given":"Luisa","family":"Montanari","sequence":"first","affiliation":[]},{"given":"Ulrike","family":"Schmidt-Kraepelin","sequence":"additional","affiliation":[]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Teh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"1599_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis G, Birmpas G, Markakis E (2018) Comparing approximate relaxations of envy-freeness. In: Proceedings of the 27th international joint conference on artificial intelligence (IJCAI), pp 42\u201348","DOI":"10.24963\/ijcai.2018\/6"},{"issue":"5","key":"1599_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2020","unstructured":"Aziz H, Moulin H, Sandomirskiy F (2020) A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper Res Lett 48(5):573\u2013578","journal-title":"Oper Res Lett"},{"key":"1599_CR3","unstructured":"Aziz H, Ganguly A, Micha E (2023) Best of both worlds fairness under entitlements. In: Proceedings of the 22nd international conference on autonomous agents and multiagent systems (AAMAS), pp 941\u2013948"},{"key":"1599_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff M, Ezra T, Feige U (2021a) Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the 35th AAAI conference on artificial intelligence (AAAI), pp 5119\u20135126","DOI":"10.1609\/aaai.v35i6.16647"},{"issue":"1","key":"1599_CR5","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/moor.2020.1062","volume":"46","author":"M Babaioff","year":"2021","unstructured":"Babaioff M, Nisan N, Talgam-Cohen I (2021) Competitive equilibrium with indivisible goods and generic budgets. Math Oper Res 46(1):382\u2013403","journal-title":"Math Oper Res"},{"issue":"4","key":"1599_CR6","doi-asserted-by":"publisher","first-page":"2180","DOI":"10.1287\/moor.2021.0199","volume":"49","author":"M Babaioff","year":"2024","unstructured":"Babaioff M, Ezra T, Feige U (2024) Fair-share allocations for agents with arbitrary entitlements. Math Oper Res 49(4):2180\u20132211","journal-title":"Math Oper Res"},{"key":"1599_CR7","volume-title":"Fair representation: meeting the ideal of one man, one vote","author":"ML Balinski","year":"2001","unstructured":"Balinski ML, Young HP (2001) Fair representation: meeting the ideal of one man, one vote. Brookings Institution Press, Washington"},{"issue":"1","key":"1599_CR8","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/3381525","volume":"8","author":"S Barman","year":"2020","unstructured":"Barman S, Kumar KS (2020) Approximation algorithms for maximin fair division. ACM Trans Econ Comput 8(1):5:1-5:28","journal-title":"ACM Trans Econ Comput"},{"key":"1599_CR9","unstructured":"Barman S, Verma P (2021) Existence and computation of maximin fair allocations under matroid-rank valuations. In: Proceedings of the 20th international conference on autonomous agents and multiagent systems (AAMAS), pp 169\u2013177"},{"key":"1599_CR10","doi-asserted-by":"crossref","unstructured":"Barman S, Verma P (2022) Truthful and fair mechanisms for matroid-rank valuations. In: Proceedings of the 36th AAAI conference on artificial intelligence (AAAI), pp 4801\u20134808","DOI":"10.1609\/aaai.v36i5.20407"},{"key":"1599_CR11","unstructured":"Barman S, Narayan V, Verma P (2023) Fair chore division under binary supermodular costs. In: Proceedings of the 22nd international conference on autonomous agents and multiagent systems (AAMAS), pp 2863\u20132865"},{"key":"1599_CR12","unstructured":"Ben Uziahu G, Feige U (2023) On fair allocation of indivisible goods to submodular agents. arXiv:2303.12444 [CoRR abs]"},{"issue":"4","key":"1599_CR13","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/3485006","volume":"9","author":"N Benabbou","year":"2021","unstructured":"Benabbou N, Chakraborty M, Igarashi A, Zick Y (2021) Finding fair and efficient allocations for matroid rank valuations. ACM Trans Econ Comput 9(4):21:1-21:41","journal-title":"ACM Trans Econ Comput"},{"key":"1599_CR14","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 SJ, Taylor AD (1996) Fair division: from cake-cutting to dispute resolution. Cambridge University Press, Cambridge"},{"issue":"6","key":"1599_CR15","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish E (2011) The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J Polit Econ 119(6):1061\u20131103","journal-title":"J Polit Econ"},{"issue":"3","key":"1599_CR16","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 AD, Shah N, Wang J (2019) The unreasonable fairness of maximum Nash welfare. ACM Trans Econ Comput 7(3):12:1-12:32","journal-title":"ACM Trans Econ Comput"},{"key":"1599_CR17","unstructured":"Celine KF, Suksompong W, Yuen SM (2025) On the fairness of additive welfarist rules. In: Proceedings of the 24th international conference on autonomous agents and multiagent systems (AAMAS) (forthcoming)"},{"issue":"3","key":"1599_CR18","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3457166","volume":"9","author":"M Chakraborty","year":"2021","unstructured":"Chakraborty M, Igarashi A, Suksompong W, Zick Y (2021) Weighted envy-freeness in indivisible item allocation. ACM Trans Econ Comput 9(3):18:1-18:39","journal-title":"ACM Trans Econ Comput"},{"key":"1599_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103578","volume":"301","author":"M Chakraborty","year":"2021","unstructured":"Chakraborty M, Schmidt-Kraepelin U, Suksompong W (2021) Picking sequences and monotonicity in weighted fair division. Artif Intell 301:103578","journal-title":"Artif Intell"},{"issue":"3","key":"1599_CR20","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/3665799","volume":"12","author":"M Chakraborty","year":"2024","unstructured":"Chakraborty M, Segal-Halevi E, Suksompong W (2024) Weighted fairness notions for indivisible items revisited. ACM Trans Econ Comput 12(3):9:1-9:45","journal-title":"ACM Trans Econ Comput"},{"key":"1599_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.11291","volume":"64","author":"A Farhadi","year":"2019","unstructured":"Farhadi A, Ghodsi M, Hajiaghayi MT, Lahaie S, Pennock D, Seddighin M, Seddighin S, Yami H (2019) Fair allocation of indivisible goods to asymmetric agents. J Artif Intell Res 64:1\u201320","journal-title":"J Artif Intell Res"},{"key":"1599_CR22","doi-asserted-by":"crossref","unstructured":"Garg J, Husi\u0107 E, V\u00e9gh LA (2021) Approximating Nash social welfare under Rado valuations. In: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing (STOC), pp 1412\u20131425","DOI":"10.1145\/3406325.3451031"},{"key":"1599_CR23","unstructured":"Garg J, Husi\u0107 E, Murhekar A, V\u00e9gh L (2022) Tractable fragments of the maximum Nash welfare problem. In: Proceedings of the 18th conference on web and internet economics (WINE), pp 362\u2013363"},{"key":"1599_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103633","volume":"303","author":"M Ghodsi","year":"2022","unstructured":"Ghodsi M, HajiAghayi MT, Seddighin M, Seddighin S, Yami H (2022) Fair allocation of indivisible goods: beyond additive valuations. Artif Intell 303:103633","journal-title":"Artif Intell"},{"key":"1599_CR25","doi-asserted-by":"crossref","unstructured":"Goko H, Igarashi A, Kawase Y, Makino K, Sumita H, Tamura Y, Yokoi Y, Yokoo M (2024) A fair and truthful mechanism with limited subsidy. Games Econ Behav 144:49\u201370","DOI":"10.1016\/j.geb.2023.12.006"},{"key":"1599_CR26","unstructured":"Hintze W (2019) Analytic continuation of harmonic series. https:\/\/math.stackexchange.com\/a\/3058569. Accessed 29 Mar 2024"},{"key":"1599_CR27","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1613\/jair.1.15595","volume":"80","author":"M Hoefer","year":"2024","unstructured":"Hoefer M, Schmalhofer M, Varricchio G (2024) Best of both worlds: agents with entitlements. J Artif Intell Res 80:559\u2013591","journal-title":"J Artif Intell Res"},{"key":"1599_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09016-5","volume-title":"Multi-winner voting with approval preferences","author":"M Lackner","year":"2023","unstructured":"Lackner M, Skowron P (2023) Multi-winner voting with approval preferences. Springer, Berlin"},{"key":"1599_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2017.01.012","volume":"122","author":"E Lee","year":"2017","unstructured":"Lee E (2017) APX-hardness of maximizing Nash social welfare with indivisible items. Inf Process Lett 122:17\u201320","journal-title":"Inf Process Lett"},{"key":"1599_CR30","doi-asserted-by":"crossref","unstructured":"Lipton RJ, Markakis E, Mossel E, Saberi A (2004) On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM conference on electronic commerce (EC), pp 125\u2013131","DOI":"10.1145\/988772.988792"},{"key":"1599_CR31","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 (2003) Fair division and collective welfare. MIT Press, Cambridge"},{"key":"1599_CR32","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1146\/annurev-economics-080218-025559","volume":"11","author":"H Moulin","year":"2019","unstructured":"Moulin H (2019) Fair division in the internet age. Annu Rev Econ 11:407\u2013441","journal-title":"Annu Rev Econ"},{"issue":"2","key":"1599_CR33","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut B, Roughgarden T (2020) Almost envy-freeness with general valuations. SIAM J Discrete Math 34(2):1039\u20131068","journal-title":"SIAM J Discrete Math"},{"key":"1599_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03856-8","volume-title":"Proportional representation: apportionment methods and their applications","author":"F Pukelsheim","year":"2014","unstructured":"Pukelsheim F (2014) Proportional representation: apportionment methods and their applications. Springer, Cham"},{"key":"1599_CR35","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: be fair if you can","author":"J Robertson","year":"1998","unstructured":"Robertson J, Webb W (1998) Cake-cutting algorithms: be fair if you can. Peters\/CRC Press, Boca Raton"},{"key":"1599_CR36","unstructured":"Scarlett J, Teh N, Zick Y (2023) For one and all: Individual and group fairness in the allocation of indivisible goods. In: Proceedings of the 22nd international conference on autonomous agents and multiagent systems (AAMAS), pp 2466\u20132468"},{"key":"1599_CR37","doi-asserted-by":"crossref","unstructured":"Springer M, Hajiaghayi M, Yami H (2024) Almost envy-free allocations of indivisible goods or chores with entitlements. In: Proceedings of the 38th AAAI conference on artificial intelligence (AAAI), pp 9901\u20139908","DOI":"10.1609\/aaai.v38i9.28851"},{"issue":"1","key":"1599_CR38","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus H (1948) The problem of fair division. Econometrica 16(1):101\u2013104","journal-title":"Econometrica"},{"key":"1599_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.econlet.2022.110956","volume":"222","author":"W Suksompong","year":"2023","unstructured":"Suksompong W (2023) A characterization of maximum Nash welfare for indivisible goods. Econ Lett 222:110956","journal-title":"Econ Lett"},{"key":"1599_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2024.106519","volume":"187","author":"W Suksompong","year":"2025","unstructured":"Suksompong W (2025) Weighted fair division of indivisible items: a review. Inf Process Lett 187:106519","journal-title":"Inf Process Lett"},{"key":"1599_CR41","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.mathsocsci.2022.03.004","volume":"117","author":"W Suksompong","year":"2022","unstructured":"Suksompong W, Teh N (2022) On maximum weighted Nash welfare for binary valuations. Math Soc Sci 117:101\u2013108","journal-title":"Math Soc Sci"},{"key":"1599_CR42","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.mathsocsci.2023.09.004","volume":"126","author":"W Suksompong","year":"2023","unstructured":"Suksompong W, Teh N (2023) Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness. Math Soc Sci 126:48\u201359","journal-title":"Math Soc Sci"},{"key":"1599_CR43","doi-asserted-by":"crossref","unstructured":"Viswanathan V, Zick Y (2023a) A general framework for fair allocation with matroid rank valuations. In: Proceedings of the 24th ACM conference on economics and computation (EC), pp 1129\u20131152","DOI":"10.1145\/3580507.3597675"},{"key":"1599_CR44","unstructured":"Viswanathan V, Zick Y (2023b) Yankee Swap: a fast and simple fair allocation mechanism for matroid rank valuations. In: Proceedings of the 22nd international conference on autonomous agents and multiagent systems (AAMAS), pp 179\u2013187"},{"key":"1599_CR45","doi-asserted-by":"crossref","unstructured":"Wu X, Zhang C, Zhou S (2023) Weighted EF1 allocations for indivisible chores. In: Proceedings of the 24th ACM conference on economics and computation (EC), p 1155","DOI":"10.1145\/3580507.3597763"},{"key":"1599_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.econlet.2023.111030","volume":"224","author":"SM Yuen","year":"2023","unstructured":"Yuen SM, Suksompong W (2023) Extending the characterization of maximum Nash welfare. Econ Lett 224:111030","journal-title":"Econ Lett"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-025-01599-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00355-025-01599-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-025-01599-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T05:05:45Z","timestamp":1764047145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00355-025-01599-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,17]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1599"],"URL":"https:\/\/doi.org\/10.1007\/s00355-025-01599-6","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"value":"0176-1714","type":"print"},{"value":"1432-217X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,17]]},"assertion":[{"value":"28 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}