2019/05/31 by Jiarui Gan, Warut Suksompong, Alexandros A. Voudouris · 1 citation
Computer Science · #cs.GT
paper · pdf · doi:10.1016/j.mathsocsci.2019.07.005
published as Mathematical Social Sciences, 101:104-106 (2019)
arxiv created 2019/08/01 · arxiv updated 2019/08/16
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.