期刊
JOURNAL OF THE ACM
卷 65, 期 2, 页码 -出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3140756
关键词
Computational fair division
类别
资金
- NSF [CCF-1215883, CCF-1525932, IIS-1350598]
- Sloan Research Fellowship
We consider the problem of fairly allocating indivisible goods, focusing on a recently introduced notion of fairness called maximin share guarantee: each player's value for his allocation should be at least as high as what he can guarantee by dividing the items into as many bundles as there are players and receiving his least desirable bundle. Assuming additive valuation functions, we show that such allocations may not exist, but allocations guaranteeing each player 2/3 of the above value always exist. These theoretical results have direct practical implications.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据