Author

Trung Thanh Nguyen

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#artificial intelligence Preprint Oct 2026

Improving the Bounds on Approximating Weighted Maximin Share for Chores

We investigate the problem of allocating indivisible chores among agents with arbitrary positive weights and additive nonnegative cost functions. An allocation is said to be $\alpha$-weighted-maximin-share (WMMS) fair if the cost incurred by each agent is at most $\alpha$ times her weighted maximin share. We establish...

Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe · 0 citations

#artificial intelligence Preprint Oct 2026

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