Group-Fair Online Allocation in Continuous Time

06/11/2020
by   Semih Cayci, et al.
0

The theory of discrete-time online learning has been successfully applied in many problems that involve sequential decision-making under uncertainty. However, in many applications including contractual hiring in online freelancing platforms and server allocation in cloud computing systems, the outcome of each action is observed only after a random and action-dependent time. Furthermore, as a consequence of certain ethical and economic concerns, the controller may impose deadlines on the completion of each task, and require fairness across different groups in the allocation of total time budget B. In order to address these applications, we consider continuous-time online learning problem with fairness considerations, and present a novel framework based on continuous-time utility maximization. We show that this formulation recovers reward-maximizing, max-min fair and proportionally fair allocation rules across different groups as special cases. We characterize the optimal offline policy, which allocates the total time between different actions in an optimally fair way (as defined by the utility function), and impose deadlines to maximize time-efficiency. In the absence of any statistical knowledge, we propose a novel online learning algorithm based on dual ascent optimization for time averages, and prove that it achieves Õ(B^-1/2) regret bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2014

A continuous-time approach to online optimization

We consider a family of learning strategies for online optimization prob...
research
09/23/2022

Doubly Fair Dynamic Pricing

We study the problem of online dynamic pricing with two types of fairnes...
research
06/01/2022

Continuous Prediction with Experts' Advice

Prediction with experts' advice is one of the most fundamental problems ...
research
06/09/2021

A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback

In a wide variety of applications including online advertising, contract...
research
11/01/2021

Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank

Online learning to rank (OL2R) has attracted great research interests in...
research
06/20/2021

Optimal Strategies for Decision Theoretic Online Learning

We extend the drifting games analysis to continuous time and show that t...
research
03/20/2023

Fair Healthcare Rationing to Maximize Dynamic Utilities

Allocation of scarce healthcare resources under limited logistic and inf...

Please sign up or login with your details

Forgot password? Click here to reset