arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.05240cs.GT
收藏

图上分配的邻域稳定性

Neighborhood Stability in Assignments on Graphs

Haris Aziz, Grzegorz Lisowski, Mashbat Suzuki, Jeremy Vollen

AI总结:

本文研究图上智能体分配的邻域稳定性,证明在环和路径等特殊图类中邻域稳定分配总存在,并给出一般存在条件及多项式时间算法。

摘要:

我们研究将智能体分配到图的顶点上的问题,使得没有任何一对相邻顶点能够通过交换分配而获益——我们将这一性质称为邻域稳定性。我们进一步假设智能体的效用仅基于他们对相邻顶点被分配者的偏好,并且这些偏好是二元的。在证明即使这一非常受限的设定也不能保证邻域稳定分配之后,我们专注于能够提供此类保证的特殊情形。我们证明,当图是环或路径时,对于任何偏好配置,邻域稳定分配总是存在。此外,我们给出了邻域稳定分配总是存在的一个一般条件。对于上述每一个结果,我们都给出了一个多项式时间算法来计算邻域稳定分配。

英文摘要:

We study the problem of assigning agents to the vertices of a graph such that no pair of neighbors can benefit from swapping assignments -- a property we term neighborhood stability. We further assume that agents' utilities are based solely on their preferences over the assignees of adjacent vertices and that those preferences are binary. Having shown that even this very restricted setting does not guarantee neighborhood stable assignments, we focus on special cases that provide such guarantees. We show that when the graph is a cycle or a path, a neighborhood stable assignment always exists for any preference profile. Furthermore, we give a general condition under which neighborhood stable assignments always exist. For each of these results, we give a polynomial-time algorithm to compute a neighborhood stable assignment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑