具有个体偏好图的不可分物品分配
Allocation of Indivisible Items with Individual Preference Graphs
摘要:
本文研究了当每个代理人的偏好用有向无环图表示时,不可分物品在代理人之间的分配问题。每个偏好图的顶点表示相应代理批准的项目子集。在这样的图中的弧$(a,b)$意味着相应的代理相对于项目$b$更喜欢项目$a$。我们引入了一个新的措施的代理人的不满,通过计算的数量,非分配的项目是由代理人批准,并没有更多的首选项目分配给代理人。考虑到两个问题的变种,我们寻求的方式,最大限度地减少(i)对所有代理的总不满或(ii)代理之间的最大不满的项目分配给代理。对于这两个优化问题,我们研究的计算复杂性的状态,并获得NP-硬度的结果,以及多项式算法的自然底层图形结构,如明星,树木,路径和匹配。我们还分析了这两个问题的参数化的复杂性,相对于各种参数的代理的数量,不满意的阈值,偏好图的顶点度,和树的宽度。
英文摘要:
This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference graph represent the subset of items approved of by the respective agent. An arc $(a,b)$ in such a graph means that the respective agent prefers item $a$ over item $b$. We introduce a new measure of dissatisfaction of an agent by counting the number of non-assigned items which are approved of by the agent and for which no more preferred item is allocated to the agent. Considering two problem variants, we seek an allocation of the items to the agents in a way that minimizes (i) the total dissatisfaction over all agents or (ii) the maximum dissatisfaction among the agents. For both optimization problems we study the status of computational complexity and obtain NP-hardness results as well as polynomial algorithms with respect to natural underlying graph structures, such as stars, trees, paths, and matchings. We also analyze the parameterized complexity of the two problems with respect to various parameters related to the number of agents, the dissatisfaction threshold, the vertex degrees of the preference graphs, and the treewidth.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。