时间冲突下Agent的任务调度:一种参数化的复杂性方法
Assigning tasks to agents under time conflicts: a parameterized complexity approach
摘要:
我们考虑的问题分配任务的代理下的时间冲突,应用程序也在点对点无线网络中的频率分配。特别地,我们给出了一组$n$代理的$V$、一组$m$任务的$E$和$k$不同的时隙。每个任务可以在$k$预定义的时隙之一中执行,并且可以由所涉及的代理的子集$e\subseteq E$表示。由于每个代理不能同时参与多个任务,我们必须找到一个分配,分配不重叠的任务,每个时隙。由于槽的数量受到$k$的限制,一般来说,不可能执行所有可能的任务,我们的目标是确定一个解决方案,最大化的整体社会福利,即执行任务的数量。我们专注于这个问题的限制,其中时隙的数量是固定的$k=2$,每个任务是由两个代理,即$|e|=2$。事实上,即使在这种假设下,这个问题仍然具有挑战性,因为它仍然是计算困难的。我们提供了参数化的复杂性的结果,相对于几个合理的参数,显示不同的情况下,该问题是固定参数易处理的或它是paraNP-硬的。
英文摘要:
We consider the problem of assigning tasks to agents under time conflicts, with applications also to frequency allocations in point-to-point wireless networks. In particular, we are given a set $V$ of $n$ agents, a set $E$ of $m$ tasks, and $k$ different time slots. Each task can be carried out in one of the $k$ predefined time slots, and can be represented by the subset $e\subseteq E$ of the involved agents. Since each agent cannot participate to more than one task simultaneously, we must find an allocation that assigns non-overlapping tasks to each time slot. Being the number of slots limited by $k$, in general it is not possible to executed all the possible tasks, and our aim is to determine a solution maximizing the overall social welfare, that is the number of executed tasks. We focus on the restriction of this problem in which the number of time slots is fixed to be $k=2$, and each task is performed by exactly two agents, that is $|e|=2$. In fact, even under this assumptions, the problem is still challenging, as it remains computationally difficult. We provide parameterized complexity results with respect to several reasonable parameters, showing for the different cases that the problem is fixed-parameter tractable or it is paraNP-hard.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。