{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:57:02Z","timestamp":1773802622615,"version":"3.50.1"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"20","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAAI"],"abstract":"<jats:p>House allocations concern with matchings involving one-sided preferences, where houses serve as a proxy encoding valuable indivisible resources  (e.g. organs, course seats, subsidized public housing units) to be allocated among the agents. Every agent must receive exactly one resource.  \nWe study algorithmic approaches towards ensuring fairness in such settings. Minimizing the number of envious agents is known to be computationally hard. We present two tractable approaches to deal with the hardness. \nWhen the agents are presented with an initial allocation of houses, we aim to refine this allocation by reallocating a bounded number of houses to reduce the number of envious agents. We show an efficient algorithm when the agents express preference for a bounded number of houses and houses are accepted by a bounded number of agents. Next, we consider single peaked preference domain and present a polynomial time algorithm for finding an allocation that minimize the number of envious agents. We further extend it to satisfy Pareto efficiency. Our former algorithm works for other measures of envy such as total envy, or maximum envy, with\nsuitable modifications. Finally, we present\nan empirical analysis recording the fairness-welfare trade-off\nof our algorithms.<\/jats:p>","DOI":"10.1609\/aaai.v40i20.38753","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:51:06Z","timestamp":1773795066000},"page":"17050-17058","source":"Crossref","is-referenced-by-count":0,"title":["Fair Societies: Algorithms for House Allocations"],"prefix":"10.1609","volume":"40","author":[{"given":"Hadi","family":"Hosseini","sequence":"first","affiliation":[]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Aditi","family":"Sethia","sequence":"additional","affiliation":[]}],"member":"9382","published-online":{"date-parts":[[2026,3,14]]},"container-title":["Proceedings of the AAAI Conference on Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/download\/38753\/42715","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/download\/38753\/42715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:51:06Z","timestamp":1773795066000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/38753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,14]]},"references-count":0,"journal-issue":{"issue":"20","published-online":{"date-parts":[[2026,3,17]]}},"URL":"https:\/\/doi.org\/10.1609\/aaai.v40i20.38753","relation":{},"ISSN":["2374-3468","2159-5399"],"issn-type":[{"value":"2374-3468","type":"electronic"},{"value":"2159-5399","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3,14]]}}}