What type of study is this?

This is a Quantitative Study study.

October 2, 2025Open Access

Existence of Fair and Efficient Allocation of Indivisible Chores

View Full Paper

Ask AI

Bookmark

An allocation can be both envy-free up to one chore and Pareto optimal for indivisible chores under additive cost functions.
The existence of EF1 and fractional Pareto optimal allocations is confirmed, demonstrating a stronger efficiency than traditional Pareto optimality.
Polynomial time computation of EF1 and Pareto optimal allocations is achievable when the number of agents remains constant.
The findings extend to a weighted EF1 framework, accommodating individual entitlements for more equitable allocations.

No takes yet. Share an insight, caveat, or question.

This research reveals the existence of envy-free and Pareto optimal allocations in indivisible chores, indicating new methods for fair distribution.

Ryoga Mahara (2025) studied this question.

View Full Paper

Ask AI

Bookmark

This research reveals the existence of envy-free and Pareto optimal allocations in indivisible chores, indicating new methods for fair distribution.