Approximately EFX Allocations for Indivisible Chores

09/15/2021
by   Shengwei Zhou, et al.
0

In this paper we study how to fairly allocate a set of m indivisible chores to a group of n agents, each of which has a general additive cost function on the items. Since envy-free (EF) allocation is not guaranteed to exist, we consider the notion of envy-freeness up to any item (EFX). In contrast to the fruitful results regarding the (approximation of) EFX allocations for goods, very little is known for the allocation of chores. Prior to our work, for the allocation of chores, it is known that EFX allocations always exist for two agents, or general number of agents with IDO cost functions. For general instances, no non-trivial approximation result regarding EFX allocation is known. In this paper we make some progress in this direction by showing that for three agents we can always compute a 5-approximation of EFX allocation in polynomial time. For n>=4 agents, our algorithm always computes an allocation that achieves an approximation ratio of O(n^2) regarding EFX.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2021

PROPm Allocations of Indivisible Goods to Multiple Agents

We study the classic problem of fairly allocating a set of indivisible g...
research
02/26/2023

MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results

We study the problem of allocating indivisible chores to agents under th...
research
03/22/2021

Almost Proportional Allocations for Indivisible Chores

In this paper, we consider how to fairly allocate m indivisible chores t...
research
06/28/2021

Approximately Envy-Free Budget-Feasible Allocation

In the budget-feasible allocation problem, a set of items with varied si...
research
11/29/2022

On the Envy-free Allocation of Chores

We study the problem of allocating a set of indivisible chores to three ...
research
02/09/2023

A Reduction from Chores Allocation to Job Scheduling

We consider allocating indivisible chores among agents with different co...
research
08/09/2023

Improved EFX Approximation Guarantees under Ordinal-based Assumptions

Our work studies the fair allocation of indivisible items to a set of ag...

Please sign up or login with your details

Forgot password? Click here to reset