Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
New algorithm guarantees fair reviewer assignments while minimizing workload, solving a major conference logistics problem.
A team of computer scientists has developed a breakthrough algorithm that solves the long-standing problem of fairly assigning paper reviews in academic conferences. The research, titled "Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously," addresses how conference organizers can distribute review workload among committee members when papers have varying difficulty levels (represented as costs) and reviewers have different preferences. The algorithm ensures that no reviewer feels unfairly burdened while minimizing the total effort required across the committee.
The core innovation lies in achieving three desirable properties simultaneously: EFX fairness (where no reviewer envies another after removing any single paper), MMS fairness (ensuring each reviewer gets at least their fair share), and efficiency through a 2-approximation of optimal social cost. The researchers proved this approximation ratio is optimal—no algorithm can do better. For practical implementation, they also developed polynomial-time versions with slightly relaxed fairness guarantees, making the solution scalable for real-world conferences like WWW 2026 where this work will be presented.
This work represents a significant advance in computational fair division, moving from theoretical ideals to practical solutions. By modeling paper reviews as "chores with restricted additive costs"—where reviewers incur zero cost for papers they bid on and full cost for others—the algorithm mirrors real conference dynamics. The solution has immediate applications for major academic venues struggling with review assignment logistics, potentially saving hundreds of hours in manual assignment work while ensuring more equitable distribution of academic service burdens.
- Achieves EFX and MMS fairness simultaneously for the first time in chore allocation with restricted costs
- Provides optimal 2-approximation of minimum social cost—proven impossible to improve upon
- Includes polynomial-time variants for practical implementation in real conference systems
Why It Matters
Automates and optimizes paper review assignments for major conferences, saving organizers hundreds of hours while ensuring fair workload distribution.