@inproceedings{39f3abd163814b9bb227670f00e9b3f5,
title = "Fair Division of Chores with Budget Constraints",
abstract = "We study fair allocation of indivisible chores to agents under budget constraints, where each chore has an objective size and disutility. This model captures scenarios where a set of chores need to be divided among agents with limited time, and each chore has a specific time needed for completion. We propose a budget-constrained model for allocating indivisible chores, and systematically explore the differences between goods and chores in this setting. We establish the existence of an EFX allocation. We then show that EF2 allocations are polynomial-time computable in general; for many restricted settings, we strengthen this result to EF1.",
keywords = "Budget Constraints, Chores, Fair Allocation",
author = "Edith Elkind and Ayumi Igarashi and Nicholas Teh",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 17th International Symposium on Algorithmic Game Theory, SAGT 2024 ; Conference date: 03-09-2024 Through 06-09-2024",
year = "2024",
doi = "10.1007/978-3-031-71033-9_4",
language = "English (US)",
isbn = "9783031710322",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "55--71",
editor = "Guido Sch{\"a}fer and Carmine Ventre",
booktitle = "Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings",
address = "Germany",
}