Log In Sign Up

Sequential Fair Allocation of Limited Resources under Stochastic Demands

by   Sean R. Sinclair, et al.

We consider the problem of dividing limited resources between a set of agents arriving sequentially with unknown (stochastic) utilities. Our goal is to find a fair allocation - one that is simultaneously Pareto-efficient and envy-free. When all utilities are known upfront, the above desiderata are simultaneously achievable (and efficiently computable) for a large class of utility functions. In a sequential setting, however, no policy can guarantee these desiderata simultaneously for all possible utility realizations. A natural online fair allocation objective is to minimize the deviation of each agent's final allocation from their fair allocation in hindsight. This translates into simultaneous guarantees for both Pareto-efficiency and envy-freeness. However, the resulting dynamic program has state-space which is exponential in the number of agents. We propose a simple policy, HopeOnline, that instead aims to `match' the ex-post fair allocation vector using the current available resources and `predicted' histogram of future utilities. We demonstrate the effectiveness of our policy compared to other heurstics on a dataset inspired by mobile food-bank allocations.


page 1

page 2

page 3

page 4


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

We consider the problem of dividing limited resources to individuals arr...

Fair Dynamic Rationing

We study the allocative challenges that governmental and nonprofit organ...

The Fairness of Leximin in Allocation of Indivisible Chores

The leximin solution – which selects an allocation that maximizes the mi...

Fair Policy Targeting

One of the major concerns of targeting interventions on individuals in s...

Efficient, Fair, and Incentive-Compatible Healthcare Rationing

As the COVID-19 pandemic shows no clear signs of subsiding, fair and eff...

Online Learning of Competitive Equilibria in Exchange Economies

The sharing of scarce resources among multiple rational agents is one of...

Yankee Swap: a Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations

We study fair allocation of indivisible goods when agents have matroid r...