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

关于社交网络的二元公平分割

On Fair Division with Binary Valuations Respecting Social Networks

Neeldhara Misra, Debanuj Nayak

摘要:

我们研究的计算复杂性,找到公平分配的不可分割的商品在设置中的社会网络的代理商。在这种情况下,公平的概念是“本地化的”,也就是说,代理只关心分配给他们的邻居的捆绑包,而不是系统中的每个其他代理。我们全面解决了计算复杂性的本地无嫉妒和帕累托有效的分配在设置代理商的商品和底层的社会网络是由一个无向图建模的二进制估值。我们在参数化复杂性的框架下研究这个问题。我们表明,即使在相当有限的情况下,这个问题是计算上棘手的,例如,即使当底层图是一个path. We显示NP-硬度的设置中的图形只有两个不同的估值代理。我们证明了W-硬度相对于商品的数量或底层图的顶点覆盖的大小。我们还考虑的概念比例,尊重的基础图的结构,并表明,这一概念的两个自然版本有不同的复杂性:分配根据的概念,占局部性的最大程度证明是计算上难以处理的,而对于其他概念,分配问题可以建模为一个结构化的ILP,可以有效地解决。

英文摘要:

We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this context are "localized", that is, agents are only concerned about the bundles allocated to their neighbors, rather than every other agent in the system. We comprehensively address the computational complexity of finding locally envy-free and Pareto efficient allocations in the setting where the agents have binary valuations for the goods and the underlying social network is modeled by an undirected graph. We study the problem in the framework of parameterized complexity. We show that the problem is computationally intractable even in fairly restricted scenarios, for instance, even when the underlying graph is a path. We show NP-hardness for settings where the graph has only two distinct valuations among the agents. We demonstrate W-hardness with respect to the number of goods or the size of the vertex cover of the underlying graph. We also consider notions of proportionality that respect the structure of the underlying graph and show that two natural versions of this notion have different complexities: allocating according to the notion that accounts for locality to the greatest degree turns out to be computationally intractable, while for other notions, the allocation problem can be modeled as a structured ILP which can be solved efficiently.

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

↑