10 citations · 14 across the 2 of their papers we have counts for
1 paper · 1 filter
Hadi Hosseini, Andrew Searns, Erel Segal-Halevi
We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin…