The classical house allocation problem involves assigning $n$ houses (or
items) to $n$ agents according to their preferences. A key criterion in such
problems is satisfying some fairness constraints such as envy-freeness. We
consider a generalization of this problem wherein the agents