Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve

by   Sean R. Sinclair, et al.

We consider the problem of dividing limited resources to individuals arriving over T rounds. Each round has a random number of individuals arrive, and individuals can be characterized by their type (i.e. preferences over the different resources). A standard notion of `fairness' in this setting is that an allocation simultaneously satisfy envy-freeness and efficiency. The former is an individual guarantee, requiring that each agent prefers her own allocation over the allocation of any other; in contrast, efficiency is a global property, requiring that the allocations clear the available resources. For divisible resources, when the number of individuals of each type are known upfront, the above desiderata are simultaneously achievable for a large class of utility functions. However, in an online setting when the number of individuals of each type are only revealed round by round, no policy can guarantee these desiderata simultaneously, and hence the best one can do is to try and allocate so as to approximately satisfy the two properties. We show that in the online setting, the two desired properties (envy-freeness and efficiency) are in direct contention, in that any algorithm achieving additive envy-freeness up to a factor of L_T necessarily suffers an efficiency loss of at least 1 / L_T. We complement this uncertainty principle with a simple algorithm, HopeGuardrail, which allocates resources based on an adaptive threshold policy. We show that our algorithm is able to achieve any fairness-efficiency point on this frontier, and moreover, in simulation results, provides allocations close to the optimal fair solution in hindsight. This motivates its use in practical applications, as the algorithm is able to adapt to any desired fairness efficiency trade-off.


page 4

page 22


Sequential Fair Allocation of Limited Resources under Stochastic Demands

We consider the problem of dividing limited resources between a set of a...

Equitable Allocations of Indivisible Chores

We study fair allocation of indivisible chores (i.e., items with non-pos...

Joint Seat Allocation 2018: An algorithmic perspective

Until 2014, admissions to the Indian Institutes of Technology (IITs) wer...

Equitable Allocation of Healthcare Resources with Fair Cox Models

Healthcare programs such as Medicaid provide crucial services to vulnera...

Proportionally Fair Online Allocation of Public Goods with Predictions

We design online algorithms for the fair allocation of public goods to a...

Online Learning with an Unknown Fairness Metric

We consider the problem of online learning in the linear contextual band...

Achieving Envy-freeness and Equitability with Monetary Transfers

When allocating indivisible resources or tasks, an envy-free allocation ...

Please sign up or login with your details

Forgot password? Click here to reset