MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results

Mingyu Xiao, Guoliang Qiu, Sen Huang

We study the problem of allocating indivisible chores to agents under the Maximin share (MMS) fairness notion. The chores are embedded on a graph and each bundle of chores assigned…