{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:24Z","timestamp":1750219944424,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-20-CE23-0018"],"award-info":[{"award-number":["ANR-20-CE23-0018"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>\n            We consider the problem of allocating indivisible items to agents where both agents and items are partitioned into disjoint groups. Following previous works on public housing allocation, each item (or house) belongs to a block (or building) and each agent is assigned a type (e.g., ethnicity group). The allocation problem consists in assigning at most one item to each agent in a\n            <jats:italic>good<\/jats:italic>\n            way while respecting diversity constraints. Based on Schelling\u2019s seminal work, we introduce a generic individual utility function where the welfare of an agent not only relies on her preferences over the items but also takes into account the fraction of agents of her own type in her own block. In this context, we investigate the issue of stability, understood here as the absence of mutually improving swaps, and we define the cost of requiring it. Then, we study the behaviour of two existing allocation mechanisms: an adaptation of the sequential mechanism used in Singapore and a distributed procedure based on mutually improving swaps of items. We first present the theoretical properties of these two allocation mechanisms, and we then compare their performances in practice through an experimental study.\n          <\/jats:p>","DOI":"10.1145\/3569704","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T11:08:51Z","timestamp":1677841731000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Sequential and Swap Mechanisms for Public Housing Allocation with Quotas and Neighbourhood-based Utilities"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3652-0393","authenticated-orcid":false,"given":"Nathana\u00ebl","family":"Gross\u2013Humbert","sequence":"first","affiliation":[{"name":"LIP6-CNRS, Sorbonne Universit\u00e9, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4589-4162","authenticated-orcid":false,"given":"Nawal","family":"Benabbou","sequence":"additional","affiliation":[{"name":"LIP6-CNRS, Sorbonne Universit\u00e9, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-6755","authenticated-orcid":false,"given":"Aur\u00e9lie","family":"Beynier","sequence":"additional","affiliation":[{"name":"LIP6-CNRS, Sorbonne Universit\u00e9, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4232-069X","authenticated-orcid":false,"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[{"name":"LIP6-CNRS, Sorbonne Universit\u00e9, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.2307\/2998580"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5541"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1257\/mic.20170364"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i09.7082"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3327970"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/3237383.3237843"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/20"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/3306127.3331741"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2016.03.003"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-319-99660-8_13","volume-title":"Algorithmic Game Theory","author":"Chauhan Ankit","year":"2018","unstructured":"Ankit Chauhan, Pascal Lenzner, and Louise Molitor. 2018. Schelling segregation with strategic agents. In Algorithmic Game Theory. Springer International Publishing, 137\u2013149."},{"key":"e_1_3_3_13_2","volume-title":"Proceedings of the 14th International Conference on Autonomous Agents and MultiAgent System","author":"Damamme Anastasia","year":"2015","unstructured":"Anastasia Damamme, Aur\u00e9lie Beynier, Yann Chevaleyre, and Nicolas Maudet. 2015. The power of swap deals in distributed resource allocation. In Proceedings of the 14th International Conference on Autonomous Agents and MultiAgent System."},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/38"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/45"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1870"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_38"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398846"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10568"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/3367032.3367103"},{"key":"e_1_3_3_21_2","first-page":"97","volume-title":"Proceedings of the 18th Computing: Australian Theory Symposium (CATS\u201912)","author":"Olsen M.","year":"2012","unstructured":"M. Olsen. 2012. On defining and computing communities. In Proceedings of the 18th Computing: Australian Theory Symposium (CATS\u201912). 97\u2013102."},{"key":"e_1_3_3_22_2","unstructured":"Ronald de Haan. 2017. Why a Dutch court stopped high school students from swapping schools. Retrieved from https:\/\/medium.com\/social-choice\/why-a-dutch-court-stopped-high-school-students-from-exchanging-schools-1315303a48b6. Accessed: 2020-10-08."},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00335"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.2307\/1823701"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/691"},{"key":"e_1_3_3_26_2","first-page":"373","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909)","author":"Zheng Xiaoming","year":"2009","unstructured":"Xiaoming Zheng and Sven Koenig. 2009. K-Swaps: Cooperative negotiation for solving task-allocation problems. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909). 373\u2013379. Retrieved from http:\/\/ijcai.org\/Proceedings\/09\/Papers\/070.pdf."},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2018.01.003"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569704","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,31]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3569704"],"URL":"https:\/\/doi.org\/10.1145\/3569704","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2022,12,31]]},"assertion":[{"value":"2021-10-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}