arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.01323cs.GTcs.AI
收藏

图上的房屋分配问题

Graphical House Allocation

Penn State Univ.(宾夕法尼亚州立大学);Univ. of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);IIT Delhi(印度理工学院德里分校)

Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan

AI总结:

本文研究图结构下考虑邻居嫉妒的房屋分配问题,提出可分离性等结构性质,并给出多类图上的NP困难性与固定参数可解算法。

摘要:

经典的房屋分配问题涉及根据偏好将n套房屋(或物品)分配给n个智能体。此类问题中的一个关键标准是满足某些公平性约束,例如无嫉妒性。我们考虑该问题的一种推广情形:智能体被放置在图的顶点上(对应一个社交网络),每个智能体只能对其邻居产生嫉妒。我们的目标是最小化智能体之间的总体嫉妒,作为一个自然的公平性目标,即社交图中所有边上两两嫉妒值的总和。当智能体具有相同且均匀间隔的估值时,我们的问题退化为已被广泛研究的线性排列问题。对于具有可能不均匀间隔的相同估值,我们展示了若干深刻且令人惊讶的结果,表明我们的设定在多个方面偏离了这一经典问题。更广泛地,我们针对各类图给出了若干结构性和计算性结果,包括路径、环、星形图或团的不相交并集的NP困难性结果,以及路径、环、星形图、团及其不相交并集的固定参数可解(在某些情况下为多项式时间)算法。此外,我们工作的一个概念性贡献是提出了针对不连通图的一种结构性性质,我们称之为可分离性,该性质能够导出用于寻找最优分配的高效参数化算法。

英文摘要:

The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences. A key criterion in such problems is satisfying some fairness constraints such as envy-freeness. We consider a generalization of this problem wherein the agents are placed along the vertices of a graph (corresponding to a social network), and each agent can only experience envy towards its neighbors. Our goal is to minimize the aggregate envy among the agents as a natural fairness objective, i.e., the sum of all pairwise envy values over all edges in a social graph. When agents have identical and evenly-spaced valuations, our problem reduces to the well-studied problem of linear arrangements. For identical valuations with possibly uneven spacing, we show a number of deep and surprising ways in which our setting is a departure from this classical problem. More broadly, we contribute several structural and computational results for various classes of graphs, including NP-hardness results for disjoint unions of paths, cycles, stars, or cliques, and fixed-parameter tractable (and, in some cases, polynomial-time) algorithms for paths, cycles, stars, cliques, and their disjoint unions. Additionally, a conceptual contribution of our work is the formulation of a structural property for disconnected graphs that we call separability which results in efficient parameterized algorithms for finding optimal allocations.

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

↑