Envy-Freeness in House Allocation Problems
Mathematical Social Sciences, pp. 104-106, 2019.
We consider the house allocation problem, where m houses are to be assigned to n agents so that each agent gets exactly one house. We present a polynomial-time algorithm that determines whether an envy-free assignment exists, and if so, computes one such assignment. We also show that an envy-free assignment exists with high probability if...More
PPT (Upload PPT)