N人无羡家务分工
N-person envy-free chore division
摘要：
与经典的切蛋糕问题（如何公平地分割一个想要的对象）不同，“家务分割”是如何分割一个不想要的对象的问题。我们开发了第一个显式算法，用于在N人之间进行无嫉妒的家务分工，这与Brams-Taylor（1995）的N人无嫉妒的蛋糕分工解决方案相对应。这是通过利用家务“不可撤销的优势”的概念来实现的。我们讨论了蛋糕切割和家务分工之间的差异和家务分工中遇到的其他问题。
英文摘要：
In contrast to the classical cake-cutting problem (how to fairly divide a desirable object), "chore division" is the problem of how to divide an undesirable object. We develop the first explicit algorithm for envy-free chore division among N people, a counterpart to the N-person envy-free cake-division solution of Brams-Taylor (1995). This is accomplished by exploiting a notion of "irrevocable advantage" for chores. We discuss the differences between cake-cutting and chore division and additional problems encountered in chore division.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
