(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna

no code implementations • 6 Feb 2022 • Vasilis Livanos, Ruta Mehta, Aniket Murhekar

We study two types of instances: (i) Separable, where the item set can be partitioned into goods and bads, and (ii) Restricted mixed goods (RMG), where for each item $j$, every agent has either a non-positive value for $j$, or values $j$ at the same $v_j>0$.

Fairness