- 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
- Files:
-
-
(pdf)
-
- Publisher copy:
- 10.1016/j.mathsocsci.2019.07.005
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
- Publisher:
- Elsevier Publisher's website
- Journal:
- Mathematical Social Sciences Journal website
- Volume:
- 101
- Pages:
- 104-106
- Publication date:
- 2019-07-30
- Acceptance date:
- 2019-07-22
- DOI:
- ISSN:
-
0165-4896
- Pubs id:
-
pubs:1046097
- UUID:
-
uuid:6de5c0c9-e387-4a32-bf11-301bbaf35d56
- Source identifiers:
-
1046097
- Local pid:
- pubs:1046097
- Language:
- English
- 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
Journal article
Envy-freeness in house allocation problems
Actions
Access Document
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
Item Description
Terms of use
Metrics
Altmetrics
Dimensions
If you are the owner of this record, you can report an update to it here: Report update to this record