Indivisible CHORE

Fair division of indivisible chores, a problem focusing on the equitable allocation of undesirable tasks among multiple agents, is a growing area of research. Current work explores various fairness criteria, such as envy-freeness and proportionality, considering both the individual cost of assigned chores and the impact of others' assignments (externalities), often within the context of specific cost function models (e.g., binary supermodular). Algorithms are being developed to find allocations satisfying these criteria, with a focus on computational efficiency and addressing the challenges posed by indivisibility and strategic behavior. This research has implications for resource allocation in various domains, from household chores to more complex scenarios involving the distribution of undesirable tasks or responsibilities.