Fair and efficient allocations when preferences are single-dipped
研究在单谷偏好下分配一种无限可分且不可丢弃的商品，结合帕累托最优与多种公平要求，给出兼容条件并刻画所有分配方案。
One unit of an infinitely divisible and non-disposable commodity has to be allocated among a group of agents with single-dipped preferences. We combine Pareto optimality with equal treatment of equals, the equal division lower bound, the equal division core, envy-freeness, and group envy-freeness. For each of these fairness requirements, we provide a necessary and sufficient condition for compatibility with Pareto optimality and we characterize all corresponding allocations for each preference profile.