论文标题
Maxmin和Minmax Envy免租金部的多项式算法，以软预算
A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
论文作者
论文摘要
由公平分配网站Spliddit领导的当前无嫉妒租金部门的实践是基于准线性偏好的。这些偏好排除了代理商的财务限制。为了解决此问题，我们考虑按照线性预算有限的偏好。这些偏好承认代理商在给定参考的低于和更高的租金（即软预算）上的边际差异的差异。我们构建了多项式算法，以计算该域中的Maxmin实用程序嫉妒的无嫉妒分配以及其他相关的解决方案。
The current practice of envy-free rent division, lead by the fair allocation website Spliddit, is based on quasi-linear preferences. These preferences rule out agents' well documented financial constraints. To resolve this issue we consider piece-wise linear budget constrained preferences. These preferences admit differences in agents' marginal disutility of paying rent below and above a given reference, i.e., a soft budget. We construct a polynomial algorithm to calculate a maxmin utility envy-free allocation, and other related solutions, in this domain.
