Group envy freeness and group pareto efficiency in fair division with indivisible items

14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the fair division of items to agents supposing that agents can form groups. We thus give natural generalizations of popular concepts such as envy-freeness and Pareto efficiency to groups of fixed sizes. Group envy-freeness requires that no group envies another group. Group Pareto efficiency requires that no group can be made better off without another group be made worse off. We study these new group properties from an axiomatic viewpoint. We thus propose new fairness taxonomies that generalize existing taxonomies. We further study near versions of these group properties as allocations for some of them may not exist. We finally give three prices of group fairness between group properties for three common social welfares (i.e. utilitarian, egalitarian and Nash).

Cite

CITATION STYLE

APA

Aleksandrov, M., & Walsh, T. (2018). Group envy freeness and group pareto efficiency in fair division with indivisible items. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11117 LNAI, pp. 57–72). Springer Verlag. https://doi.org/10.1007/978-3-030-00111-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free