尊重接纳社区偏好的难民安置
Host Community Respecting Refugee Housing
AI总结：
提出尊重接纳社区与难民偏好的安置模型，研究稳定安置的存在条件与计算复杂性，并利用参数化复杂性框架分析NP难问题的细粒度复杂度。
摘要：
我们提出了一种新颖的难民安置模型，该模型尊重接纳社区和难民自身的偏好。具体而言，给定一个表示当地社区的拓扑结构、一组占据拓扑中某些顶点的居民，以及一组应安置在图空顶点上的难民。居民和难民都对各自邻域的结构有偏好。我们特别关注寻找满足每个个体偏好的安置方案的问题；用博弈论的术语来说，我们寻找相对于某个明确定义的稳定性概念而言稳定的安置方案。我们研究了保证均衡存在性的条件，并研究了找到这种稳定结果的计算复杂性。由于该问题即使在非常简单的设置下也是NP难的，我们采用参数化复杂性框架，针对给定拓扑的自然参数和结构限制，对该问题的复杂性进行更细粒度的分析。
英文摘要：
We propose a novel model for refugee housing respecting the preferences of the accepting community and refugees themselves. In particular, we are given a topology representing the local community, a set of inhabitants occupying some vertices of the topology, and a set of refugees that should be housed on the empty vertices of the graph. Both the inhabitants and the refugees have preferences over the structure of their neighborhood. We are specifically interested in the problem of finding housing such that the preferences of every individual are met; using game-theoretical words, we are looking for housing that is stable with respect to some well-defined notion of stability. We investigate conditions under which the existence of equilibria is guaranteed and study the computational complexity of finding such a stable outcome. As the problem is NP-hard even in very simple settings, we employ the parameterized complexity framework to give a finer-grained view of the problem's complexity with respect to natural parameters and structural restrictions of the given topology.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
