Journal article

Envy-freeness in house allocation problems

Abstract:: 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

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gan, J., Suksompong, W., & Voudouris, A. (2019). Envy-freeness in house allocation problems. Mathematical Social Sciences, 101, 104–106.

MLA Style

Gan, J., et al. “Envy-Freeness in House Allocation Problems.” Mathematical Social Sciences, vol. 101, Elsevier, 2019, pp. 104–06.

Chicago Style

Gan, J, W Suksompong, and A Voudouris. 2019. “Envy-Freeness in House Allocation Problems.” Mathematical Social Sciences 101: 104–6.
Share
Print

Access Document

Files:: 1905.00468.pdf

(Preview, Accepted manuscript, pdf, 80.7KB, Terms of use)

Publisher copy:: 10.1016/j.mathsocsci.2019.07.005

Authors

+ Gan, J More by this author

Institution:: University of Oxford
Department:: Computer Science
Role:: Author

+ Suksompong, W More by this author

Institution:: University of Oxford
Department:: Computer Science
Department:: Unknown
Role:: Author

+ Voudouris, A More by this author

Institution:: University of Oxford
Department:: Computer Science
Role:: Author
ORCID:: 0000-0003-1105-3856

Publisher:: Elsevier
Journal:: Mathematical Social Sciences More from this journal
Volume:: 101
Pages:: 104-106
Publication date:: 2019-07-30
Acceptance date:: 2019-07-22
DOI:: 10.1016/j.mathsocsci.2019.07.005
ISSN:: 0165-4896

Language:: English
Pubs id:: pubs:1046097
UUID:: uuid:6de5c0c9-e387-4a32-bf11-301bbaf35d56
Local pid:: pubs:1046097
Source identifiers:: 1046097
Deposit date:: 2019-08-19

Terms of use

Copyright holder:: Elsevier BV
Copyright date:: 2019
Rights statement:: © 2019 Elsevier B.V. All rights reserved
Notes:: This is the accepted manuscript version of the article. The publisher's version is available online

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP