Diverse fair allocations: Complexity and algorithms

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
Harshil Mittal, Saraswati Nanoti, Aditi Sethia
{"title":"Diverse fair allocations: Complexity and algorithms","authors":"Harshil Mittal,&nbsp;Saraswati Nanoti,&nbsp;Aditi Sethia","doi":"10.1016/j.dam.2024.07.045","DOIUrl":null,"url":null,"abstract":"<div><p>In this work, we initiate the study of diversity of solutions in the context of fair division of indivisible goods. In particular, we explore the notions of disjoint, distinct and symmetric allocations and study their complexity in terms of the fairness notions of <em>envy-freeness</em> and <em>equitability up to one item</em>. We show that for binary valuations, the above problems are polynomial time solvable. In contrast we show NP-hardness of disjoint and symmetric case, when the valuations are additive.</p></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"359 ","pages":"Pages 343-353"},"PeriodicalIF":1.0000,"publicationDate":"2024-08-24","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/S0166218X24003457","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, we initiate the study of diversity of solutions in the context of fair division of indivisible goods. In particular, we explore the notions of disjoint, distinct and symmetric allocations and study their complexity in terms of the fairness notions of envy-freeness and equitability up to one item. We show that for binary valuations, the above problems are polynomial time solvable. In contrast we show NP-hardness of disjoint and symmetric case, when the valuations are additive.

多样化的公平分配:复杂性与算法
在这项工作中,我们开始研究不可分割物品公平分配中解决方案的多样性。特别是,我们探讨了不相交、不同和对称分配的概念,并从无嫉妒和公平性概念的角度研究了它们的复杂性。我们证明,对于二进制估值,上述问题都可以在多项式时间内解决。相反,当估值为加法时,我们证明了不相交和对称情况下的 NP 难度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信