Can Money Cure Housing Envy? New Math Finds the Limit

Imagine a housing lottery where everyone submits their top choices for apartments, dorm rooms, or even office spaces. The dream result is no one feels envy—nobody wishes they had swapped with a neighbor. But perfect fairness rarely happens naturally, so researchers have long considered adding subsidies, or small cash payments, to soothe the losers. This paper asks: what's the cheapest way to buy peace?

The authors, Sijia Dai and colleagues, looked at a classic math problem called house allocation. They found a nice rule for simple cases: if people only say "I like it" or "I don't like it" about each house, then offering payments to at most n-1 people (where n is the number of people) guarantees envy-freeness. That's surprisingly small. But they also proved a catch: finding the absolute minimum subsidy bill is what computer scientists call NP-hard—a problem so tough that even a supercomputer might take centuries for big enough cases.

Yet there's a silver lining. If you group people into a small number of "types"—say, students, families, and retirees—the problem becomes solvable quickly. For example, with just two types of people, they designed an efficient algorithm that calculates the least money needed. That means real-world organizers can use their method when the population isn't endlessly varied.

So what does this mean for you? Whether your campus assigns dorms, your city manages public housing, or your office rotates desks, decision-makers now know when they can rely on computer helpers to set fair compensation—and when they'll have to guess. It's a step toward turning envy-free fairness into a practical, budget-friendly reality.