迈向更现实的难民融合模型：带上限的匿名难民住房安置
Towards More Realistic Models for Refugee Integration: Anonymous Refugee Housing with Upper-Bounds
AI总结：
针对既有难民住房安置模型计算困难且偏好不连续的问题，本文提出更贴近实际的带上限匿名安置受限变体，并研究其计算复杂性。
摘要：
Knop 和 Schierreich（AAMAS’23）最近提出了一种新颖的难民住房安置模型：给定一座以图表示的城市拓扑、一组占据该拓扑中某些顶点的居民，以及一组需要安置在未被占据顶点上的难民。此外，每位居民都会认可其邻域内特定数量的难民，而目标是找到一种安置方式，使每位居民都认可安置在其邻域内的难民数量。然而，该模型存在若干问题：（i）找到理想的安置在计算上很困难；（ii）居民的偏好不一定连续，而这种情况在实践中几乎不会出现。为避免这些缺陷，我们引入该问题的一个受限变体，它更贴近难民住房安置的实际场景，并研究其复杂性。
英文摘要：
[Knop and Schierreich; AAMAS~'23] recently introduced a novel model for refugee housing, where we are given a city's topology represented as a graph, a set of inhabitants who occupy some vertices of the topology, and a set of refugees that we need to house in unoccupied vertices. Moreover, each inhabitant approves specific numbers of refugees in his neighbourhood, and our goal is to find housing such that every inhabitant approves the number of refugees housed in his neighbourhood. However, such a model suffers from several problems: (i) it is computationally hard to find desirable housing, and (ii) the inhabitants' preferences are not necessarily continuous, which hardly occurs in practice. To avoid these objections, we introduce a restricted variant of the problem that is more closely aligned with practical scenarios of refugee housing and study its complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
