论文标题
不可分割项目的算法公平分配：调查和新问题
Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions
论文作者
论文摘要
算法公平分配的理论在过去十年中，由于其工业和社会重要性，在过去十年的多机构系统和经济学的中心内。在高水平上，问题是将一组商品或杂务的物品分配给一组代理商，以便每个代理商对她所获得的东西感到满意。尤其是在这项调查中，我们专注于不可分割的项目，对于这些项目，无法保证诸如嫉妒和相称之类的绝对公平性。最近的研究议程中的一个主要主题是设计大约达到公平标准的算法。我们旨在通过算法的棱镜进行对最近进展的全面调查，突出了放松公平概念和设计算法的通用技术的方法，以及对于未来研究的最有趣的问题。
The theory of algorithmic fair allocation is within the center of multi-agent systems and economics in the last decade due to its industrial and social importance. At a high level, the problem is to assign a set of items that are either goods or chores to a set of agents so that every agent is happy with what she obtains. Particularly, in this survey, we focus on indivisible items, for which absolute fairness such as envy-freeness and proportionality cannot be guaranteed. One main theme in the recent research agenda is about designing algorithms that approximately achieve the fairness criteria. We aim at presenting a comprehensive survey of recent progresses through the prism of algorithms, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.
