Comment: Appears in the 17th International Symposium on Algorithmic Game Theory (SAGT), 2024We 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. For divisible chores, we develop an efficient algorithm for computing an EF allocation.