Online Learning Demands in Max-min Fairness

12/15/2020
by   Kirthevasan Kandasamy, et al.
5

We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof, but when users do not know their resource requirements. The mechanism is repeated for multiple rounds and a user's requirements can change on each round. At the end of each round, users provide feedback about the allocation they received, enabling the mechanism to learn user preferences over time. Such situations are common in the shared usage of a compute cluster among many users in an organisation, where all teams may not precisely know the amount of resources needed to execute their jobs. By understating their requirements, users will receive less than they need and consequently not achieve their goals. By overstating them, they may siphon away precious resources that could be useful to others in the organisation. We formalise this task of online learning in fair division via notions of efficiency, fairness, and strategy-proofness applicable to this setting, and study this problem under three types of feedback: when the users' observations are deterministic, when they are stochastic and follow a parametric model, and when they are stochastic and nonparametric. We derive mechanisms inspired by the classical max-min fairness procedure that achieve these requisites, and quantify the extent to which they are achieved via asymptotic rates. We corroborate these insights with an experimental evaluation on synthetic problems and a web-serving task.

READ FULL TEXT
research
06/11/2021

Online Learning of Competitive Equilibria in Exchange Economies

The sharing of scarce resources among multiple rational agents is one of...
research
12/14/2021

Mechanism Design without Money for Fair Allocations

Fairness is well studied in the context of resource allocation. Research...
research
09/25/2021

Incentives in Resource Allocation under Dynamic Demands

Every computer system – from schedulers in public clouds (Amazon, Google...
research
06/04/2021

Egalitarian Resource Sharing Over Multiple Rounds

It is often beneficial for agents to pool their resources in order to be...
research
05/17/2017

Scheduling Distributed Resources in Heterogeneous Private Clouds

We first consider the static problem of allocating resources to ( i.e. ,...
research
09/30/2022

Proportionally Fair Online Allocation of Public Goods with Predictions

We design online algorithms for the fair allocation of public goods to a...
research
06/20/2019

Multi-Category Fairness in Sponsored Search Auctions

Fairness in advertising is a topic of particular concern motivated by th...

Please sign up or login with your details

Forgot password? Click here to reset