Approximating Maximin Shares with Mixed Manna

07/17/2020
by   Rucha Kulkarni, et al.
0

We initiate the study of fair allocations of a mixed manna under the popular fairness notion of maximin share (MMS). A mixed manna allows an item to be a good for some agents and chore for others, hence strictly generalizes the well-studied goods (chores) only manna. For the good manna, Procaccia and Wang [PW14] showed non-existence of MMS allocation. This prompted works on finding an α-MMS allocation. A series of works obtained efficient algorithms, improving α to 3/4 for n≥ 5 agents. Computing an α-MMS allocation for the maximum α for which it exists is known to be NP-hard. But the question of finding α-MMS for the near best α remains unresolved. We make significant progress towards this question for mixed manna by showing a striking dichotomy: We derive two conditions and show that the problem is tractable under these, while dropping either renders the problem intractable. The conditions are: (i) number of agents is constant, and (ii) for every agent, her total value for goods differs significantly from that for chores. For instances satisfying (i) and (ii) we design a PTAS - an efficient algorithm to find (α-ϵ)-MMS allocation given ϵ>0 for the best possible α. We also show that if either condition is not satisfied then finding α-MMS for any α∈(0,1] is NP-hard, even when solution exists for α=1. As a corollary, our algorithm resolves the open question of designing a PTAS for the goods only setting with constantly many agents (best known α=3/4), and similarly also for chores only setting. In terms of techniques, we use market equilibrium as a tool to solve an MMS problem, which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2019

Fair Division of Mixed Divisible and Indivisible Goods

We study the problem of fair division when the resources contain both di...
research
06/13/2021

On the Complexity of Fair House Allocation

We study fairness in house allocation, where m houses are to be allocate...
research
11/25/2019

Fair in the Eyes of Others

Envy-freeness is a widely studied notion in resource allocation, capturi...
research
08/21/2014

A Study of Proxies for Shapley Allocations of Transport Costs

We propose and evaluate a number of solutions to the problem of calculat...
research
11/12/2018

Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints

We study the problem of allocating indivisible items to agents with addi...
research
05/04/2021

Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory

We study the allocation of indivisible goods among groups of agents usin...
research
05/04/2023

Distribution of Chores with Information Asymmetry

Fair distribution of indivisible tasks with non-positive valuations (aka...

Please sign up or login with your details

Forgot password? Click here to reset