2 papers
cs.GT2020
Indivisible Mixed Manna: On the Computability of MMS + PO Allocations
Rucha Kulkarni, Ruta Mehta, Setareh Taki
In this paper we initiate the study of finding fair and efficient allocations of an indivisible mixed manna: Divide m indivisible items among n agents under the fairness notion of…
cs.GT2019
An Improved Approximation Algorithm for Maximin Shares
Jugal Garg, Setareh Taki
Fair division is a fundamental problem in various multi-agent settings, where the goal is to divide a set of resources among agents in a fair manner. We study the case where m indi…