Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items
Not on the map. Why?
Abstract (arXiv)
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).
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 29 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2026Multilevel Fair Allocation under Additive Preferences25 Aug 2026
- 2025Multilevel Fair Allocation with Matroid-Rank Preferences30 Dec 2025
- 2024Temporal Fair Division of Indivisible Items18 Oct 2024
- 2021FaiREO: User Group Fairness for Equality of Opportunity in Course Recommendation13 Sep 2021