A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
Operations Research Letters(2020)
摘要
We consider fair allocation of indivisible items under additive utilities. We show that there exists a strongly polynomial-time algorithm that always computes an allocation satisfying Pareto optimality and proportionality up to one item even if the utilities are mixed and the agents have asymmetric weights. The result does not hold if either of Pareto optimality or PROP1 is replaced with slightly stronger concepts.
更多查看译文
关键词
Fair division,Pareto optimality,Proportionality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要