On approximate envy-freeness for indivisible chores and mixed resources

U Bhaskar, AR Sricharan, R Vaish - arXiv preprint arXiv:2012.06788, 2020 - arxiv.org
We study the fair allocation of undesirable indivisible items, or chores. While the case of
desirable indivisible items (or goods) is extensively studied, with many results known for …

A survey on fair allocation of chores

H Guo, W Li, B Deng - Mathematics, 2023 - mdpi.com
Wherever there is group life, there has been a social division of labor and resource
allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf …

Fair chore division under binary supermodular costs

S Barman, VV Narayan, P Verma - arXiv preprint arXiv:2302.11530, 2023 - arxiv.org
We study the problem of dividing indivisible chores among agents whose costs (for the
chores) are supermodular set functions with binary marginals. Such functions capture …

Equitable allocations of indivisible chores

R Freeman, S Sikdar, R Vaish, L Xia - arXiv preprint arXiv:2002.11504, 2020 - arxiv.org
We study fair allocation of indivisible chores (ie, items with non-positive value) among
agents with additive valuations. An allocation is deemed fair if it is (approximately) equitable …

Greedy algorithms for fair division of mixed manna

M Aleksandrov, T Walsh - arXiv preprint arXiv:1911.11005, 2019 - arxiv.org
We consider a multi-agent model for fair division of mixed manna (ie items for which agents
can have positive, zero or negative utilities), in which agents have additive utilities for …