Preprint
Aug 2026
The Complexity of Minimizing Subsidies in Envy-Free House Allocation
The house allocation problem is a classical one-sided matching problem that concerns the assignment of a set of $m$ houses to $n$ agents according to their preferences, where each agent is assigned exactly one house. Among the various objectives studied in this setting, envy-freeness is one of the most widely adopted f...
Sijia Dai, Min-Ming Li, Xiao-Wei Wu et al.
· 0 citations