On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem


We study the max-min fair allocation problem in which a set of m indivisible items are to be distributed among n agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item j on agent i is either 0 or some non-negative weight wj . For this setting, Asadpour et al. [2] showed that a certain… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics