The HFFD (Heterogeneous First-Fit Decreasing) algorithm is a fair division algorithm that allocates chores to agents with heterogeneous costs under Identical-Order Preference (IDO).
This implementation is based on the paper: "A Reduction from Chores Allocation to Job Scheduling" by Xin Huang and Erel Segal-Halevi (2024).
Allocates chores fairly among agents with different cost structures
Uses a two-pass approach to efficiently allocate items while respecting thresholds
Step-by-step visualization of the allocation process
For each agent, enter their valuation (cost) for each item as comma-separated numbers.
Enter the maximum cost threshold for each agent as comma-separated numbers.
Click "Run Algorithm" to see the allocation process and results.
See the final allocation, step-by-step process, and any unallocated items.