Researchers Just Proved You Can Split Hated Chores Fairly

Imagine four roommates staring at a list of chores: scrubbing the toilet, taking out the trash, washing dishes, mopping. Someone always feels cheated. A new paper by researchers Ankang Sun and Bo Li tackles exactly this problem — but in math, not in your kitchen. They proved that any group, no matter how big, can divide unpleasant tasks so that nobody feels their pile is worse than anyone else's. In academic terms, this is a "chore" version of fair division — the mirror image of splitting cake, where you want as little as possible instead of as much as possible.

The fairness rule they use has a friendly name in plain English: "envy-free up to one item." That means you might glance at your roommate's list and feel a tiny pang of envy over one single task, but everything else feels even. Their second promise is that each person's tasks stay connected — think four straight days of dishes rather than random nights scattered across the month. Connected bundles are far easier to plan around and far less annoying to live with.

The tricky part was technical. Earlier mathematicians had already solved the same puzzle for good things, like cake or bonus money, but those tricks don't translate to chores because the two problems define fairness in opposite ways. Sun and Li adapted the older rounding method — the step that turns a smooth, theoretical split into actual whole tasks — and showed it still works when the item is something you'd rather avoid.

The honest catch: this is a proof that a fair split exists and can be found, not a ready-made tool. No app yet tells you which chores to hand out at home or in the office. Still, the result matters because it says something reassuring: with the right method, a genuinely fair outcome is always possible, even when the work is thankless.