Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy, Y. Narahari
TL;DR本文研究了在 n 个代理人中公平分配不可分性商品的问题,提出了比最小限度份额更强的公平性概念:团体最小限度份额保证。我们证明,在特定情况下,总是存在 GMMS 分配,在加性估值模型下存在近似 GMMS 分配,并提出了一个多项式时间算法来找到这样的分配。此外,我们表明 GMMS 可能导致近似无嫉妒的分配。
Abstract
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically,