Envy-freeness in house allocation problems

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 as...

Descrición completa

Detalles Bibliográficos
Main Authors: Gan, J, Suksompong, W, Voudouris, A
Formato: Journal article
Idioma:English
Publicado: Elsevier 2019