Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods

Haris Aziz, Gerhard Rauchecker, Guido Schryen +1

We consider Max-min Share (MmS) allocations of items both in the case where items are goods (positive utility) and when they are chores (negative utility). We show that fair alloca…