Robust and fair work allocation

02/10/2022
by   Amine Allouah, et al.
0

In today's digital world, interaction with online platforms is ubiquitous, and thus content moderation is important for protecting users from content that do not comply with pre-established community guidelines. Having a robust content moderation system throughout every stage of planning is particularly important. We study the short-term planning problem of allocating human content reviewers to different harmful content categories. We use tools from fair division and study the application of competitive equilibrium and leximin allocation rules. Furthermore, we incorporate, to the traditional Fisher market setup, novel aspects that are of practical importance. The first aspect is the forecasted workload of different content categories. We show how a formulation that is inspired by the celebrated Eisenberg-Gale program allows us to find an allocation that not only satisfies the forecasted workload, but also fairly allocates the remaining reviewing hours among all content categories. The resulting allocation is also robust as the additional allocation provides a guardrail in cases where the actual workload deviates from the predicted workload. The second practical consideration is time dependent allocation that is motivated by the fact that partners need scheduling guidance for the reviewers across days to achieve efficiency. To address the time component, we introduce new extensions of the various fair allocation approaches for the single-time period setting, and we show that many properties extend in essence, albeit with some modifications. Related to the time component, we additionally investigate how to satisfy markets' desire for smooth allocation (e.g., partners for content reviewers prefer an allocation that does not vary much from time to time, to minimize staffing switch). We demonstrate the performance of our proposed approaches through real-world data obtained from Meta.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2021

Online Market Equilibrium with Application to Fair Division

Computing market equilibria is a problem of both theoretical and applied...
research
02/24/2020

Equitable Allocations of Indivisible Chores

We study fair allocation of indivisible chores (i.e., items with non-pos...
research
06/18/2019

Reputation Systems -- Fair allocation of points to the editors in the collaborative community

In this paper we are trying to determine a scheme for the fair allocatio...
research
10/06/2020

Infinite-Dimensional Fisher Markets and Tractable Fair Division

Linear Fisher markets are a fundamental economic model with applications...
research
02/23/2022

Nonstationary Dual Averaging and Online Fair Allocation

We consider the problem of fairly allocating items to a set of individua...
research
02/09/2023

Fair Notification Optimization: An Auction Approach

Notifications are important for the user experience in mobile apps and c...
research
04/27/2022

Fair and Efficient Allocation with Quotas

In many settings, such as the rationing of medical care and supplies, un...

Please sign up or login with your details

Forgot password? Click here to reset