Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations.

arXiv:2610.05237v1 Announce Type: cross Abstract: 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 s