Maximin Share Guarantees via Limited Cost-Sensitive Sharing

Hana Salavcova, Martin Černý, Arpita Biswas

We study the problem of fairly allocating indivisible goods when limited sharing is allowed, that is, each good may be allocated to up to $k$ agents, while incurring a cost for sha…