Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations
Thi Ngoc Anh Vu, Trung Thanh Nguyen, Khaled Elbassioni +1
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 margi…
cs.GT2026
Maximizing -Mean Social Welfare in the High-Multiplicity Setting: Few Agent Types and Few Item Types
Trung Thanh Nguyen, Khaled Elbassioni
The -mean welfare objective unifies several classical social welfare criteria for the allocation of indivisible goods. We study its maximization under additive nonnegative utili…