Improving the Bounds on Approximating Weighted Maximin Share for Chores.

arXiv:2610.15520v1 Announce Type: cross Abstract: 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 (WMM