论文标题
不可分割的商品的公平划分：最近的进度和开放问题
Fair Division of Indivisible Goods: Recent Progress and Open Questions
论文作者
论文摘要
自远古时代以来，以公平的方式将资源分配给个人一直是一个令人感兴趣的话题，大多数早期的数学工作都集中在无限分裂的资源上。在过去的十年中，有大量论文研究了有关不可分割的情况的计算问题，因为这些案例的确切公平概念（例如嫉妒性和相称性）很难满足。最近的研究议程中的一个主要主题是调查他们的放松，例如Maximin共享公平（MMS）和嫉妒的福利（EFX）的程度。在这项调查中，我们通过强调放松公平概念，常见算法设计技术以及最有趣的未来研究问题的方式，对相关文献中最近取得的进展进行了全面评论。
Allocating resources to individuals in a fair manner has been a topic of interest since ancient times, with most of the early mathematical work on the problem focusing on resources that are infinitely divisible. Over the last decade, there has been a surge of papers studying computational questions regarding the indivisible case, for which exact fairness notions such as envy-freeness and proportionality are hard to satisfy. One main theme in the recent research agenda is to investigate the extent to which their relaxations, like maximin share fairness (MMS) and envy-freeness up to any good (EFX), can be achieved. In this survey, we present a comprehensive review of the recent progress made in the related literature by highlighting different ways to relax fairness notions, common algorithm design techniques, and the most interesting questions for future research.
