Envy-Freeness in House Allocation Problems

05/01/2019

∙

by   Jiarui Gan, et al.

∙

0

∙

share

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 the number of houses exceeds the number of agents by a logarithmic factor.