Approximate maximin shares for groups of agents

Warut Suksompong

Mathematical Social Sciences, 2018, vol. 92, issue C, 40-47

Abstract: We investigate the problem of fairly allocating indivisible goods among interested agents using the concept of maximin share. Procaccia and Wang showed that while an allocation that gives every agent at least her maximin share does not necessarily exist, one that gives every agent at least 2∕3 of her share always does. In this paper, we consider the more general setting where we allocate the goods to groups of agents. The agents in each group share the same set of goods even though they may have conflicting preferences. For two groups, we characterize the cardinality of the groups for which a positive approximation of the maximin share is possible regardless of the number of goods. We also show settings where an approximation is possible or impossible when there are several groups.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S016548961730121X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:92:y:2018:i:c:p:40-47

DOI: 10.1016/j.mathsocsci.2017.09.004

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().