Xiaohui Bei , Alexander Lam , Xinhang Lu , Warut Suksompong
{"title":"Welfare loss in connected resource allocation","authors":"Xiaohui Bei , Alexander Lam , Xinhang Lu , Warut Suksompong","doi":"10.1016/j.dam.2026.01.007","DOIUrl":null,"url":null,"abstract":"<div><div>We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgraph. Our focus is on both egalitarian and utilitarian welfare. Specifically, we introduce the concept of <em>egalitarian (resp., utilitarian) price of connectivity</em>, which captures the worst-case ratio between the optimal egalitarian (resp., utilitarian) welfare among all allocations and that among connected allocations. We provide tight or asymptotically tight bounds on the price of connectivity for several large classes of graphs in the case of two agents—including graphs with vertex connectivity 1 or 2 and complete bipartite graphs—as well as for paths, stars, and cycles in the general case where the number of agents can be arbitrary.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"385 ","pages":"Pages 1-23"},"PeriodicalIF":1.1000,"publicationDate":"2026-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X26000314","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/19 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgraph. Our focus is on both egalitarian and utilitarian welfare. Specifically, we introduce the concept of egalitarian (resp., utilitarian) price of connectivity, which captures the worst-case ratio between the optimal egalitarian (resp., utilitarian) welfare among all allocations and that among connected allocations. We provide tight or asymptotically tight bounds on the price of connectivity for several large classes of graphs in the case of two agents—including graphs with vertex connectivity 1 or 2 and complete bipartite graphs—as well as for paths, stars, and cycles in the general case where the number of agents can be arbitrary.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.