On allocations that give intersecting groups their fair share

by   Uriel Feige, et al.

We consider item allocation to individual agents who have additive valuations, in settings in which there are protected groups, and the allocation needs to give each protected group its "fair" share of the total welfare. Informally, within each protected group we consider the total welfare that the allocation gives the members of the group, and compare it to the maximum possible welfare that an allocation can give to the group members. An allocation is fair towards the group if the ratio between these two values is no worse then the relative size of the group. For divisible items, our formal definition of fairness is based on the proportional share, whereas for indivisible items, it is based on the anyprice share. We present examples in which there are no fair allocations, and even not allocations that approximate the fairness requirement within a constant multiplicative factor. We then attempt to identify sufficient conditions for fair or approximately fair allocations to exist. For example, for indivisible items, when agents have identical valuations and the family of protected groups is laminar, we show that if the items are chores, then an allocation that satisfies every fairness requirement within a multiplicative factor no worse than two exists and can be found efficiently, whereas if the items are goods, no constant approximation can be guaranteed.


page 1

page 2

page 3

page 4


Democratic Fair Allocation of Indivisible Goods

We study the problem of fairly allocating indivisible goods to groups of...

Protecting the Protected Group: Circumventing Harmful Fairness

Machine Learning (ML) algorithms shape our lives. Banks use them to dete...

Fair Algorithm Design: Fair and Efficacious Machine Scheduling

Motivated by a plethora of practical examples where bias is induced by a...

Fair Ride Allocation on a Line

With the advent of the ride-sharing platform, the carpooling has become ...

Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments

We study the problem of dynamically allocating indivisible items to a gr...

Designing Equitable Algorithms

Predictive algorithms are now used to help distribute a large share of o...

Quantifying the Impact of User Attention on Fair Group Representation in Ranked Lists

In this work we introduce a novel metric for verifying group fairness in...

Please sign up or login with your details

Forgot password? Click here to reset