We study the problem of fair and efficient allocation of a set of indivisible chores to agents with additive cost functions . We consider the popular fairnessnotion of envy-freeness up to one good (EF1) with the efficiency notion ofPareto-optimality (PO) While it is known that an EF1+PO allocation exists andcan be computed in pseudo-polynomial time in the case of goods, the same problem is open for chores . Our first result is a strongly polynomial-time algorithm for computing anEF1 +PO allocation for bivalued instances, where agents have (at most) twodisutility values for the chores . To the best of our knowledge, this is the first non-trivial class of indevisible chore to admit an EF

Author(s) : Jugal Garg, Aniket Murhekar, John Qin

Links : PDF - Abstract

Code :
Coursera

Keywords : chores - po - ef - allocation - polynomial -

Leave a Reply

Your email address will not be published. Required fields are marked *