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. For divisible chores, we develop an efficient algorithm for computing an EF allocation.

翻译：本文研究了在预算约束下不可分割家务任务在智能体间的公平分配问题，其中每个任务具有客观规模与负效用。该模型刻画了如下场景：一组需要完成的家务任务必须在具有有限时间的智能体之间进行分配，且每个任务需要特定的完成时间。我们提出了一个用于分配不可分割家务任务的预算约束模型，并系统性地探讨了在此设定下物品与家务任务之间的差异。我们证明了EFX分配方案的存在性。随后，我们证明了EF2分配方案在一般情况下可在多项式时间内计算得到；对于许多受限场景，我们将此结果强化为EF1分配。针对可分割家务任务，我们提出了一种计算EF分配的高效算法。