Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations
We study the problem of computing an allocation of indivisible items that maximizes egalitarian welfare, i.e., the utility of the worst-off agent, when agents'item values or marginal values belong to a small set. For additive valuations with values in $\{p,q\}$, where $q>p>0$ and $\gcd(p,q)=1$, we give a polynomial-tim...
T. Vu, Trung Thanh Nguyen, Khaled Elbassioni et al.
· 0 citations