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

时间不一致的计划:很难找到简单的动机

Time-inconsistent Planning: Simple Motivation Is Hard to Find

Fedor V. Fomin, Torstein J. F. Strømme

摘要:

随着Kleinberg和Oren提出的图论时间不一致规划模型的引入,人们有可能研究任务设计者如何最好地支持当前偏向代理完成任务的计算复杂性。在本文中,我们研究的复杂性,找到一个选择减少代理,也就是说,如何从任务图中删除边和顶点,使目前有偏见的代理将保持动机,以达到他的目标,即使是有限的奖励。虽然这个问题一般是NP完全的,但对于实践中发生的情况或任务设计者感兴趣的解决方案来说,这并不一定是正确的。例如,任务设计者可能希望找到不太复杂的最佳任务图。因此,我们调查的问题,找到简单的激励子图。在这些结构中,座席将在最多$k$时间内修改其计划。我们量化这种简单的时间不一致性模型作为一个结构参数:在一个最小的激励子图的分支顶点(出度至少$2$的顶点)的数量。我们的结果如下:我们给出了一个线性算法,找到一个最佳的激励路径,即当$k=0$。在消极的一面,我们发现,找到一个简单的激励子图是NP-完全的,即使我们只允许一个分支顶点-揭示了简单的激励子图确实很难找到。然而,当$k$是固定的,边权重是有理数时,我们给出了一个伪多项式算法,这在实践中可能是一个合理的假设。

英文摘要:

With the introduction of the graph-theoretic time-inconsistent planning model due to Kleinberg and Oren, it has been possible to investigate the computational complexity of how a task designer best can support a present-biased agent in completing the task. In this paper, we study the complexity of finding a choice reduction for the agent; that is, how to remove edges and vertices from the task graph such that a present-biased agent will remain motivated to reach his target even for a limited reward. While this problem is NP-complete in general, this is not necessarily true for instances which occur in practice, or for solutions which are of interest to task designers. For instance, a task designer may desire to find the best task graph which is not too complicated. We therefore investigate the problem of finding simple motivating subgraphs. These are structures where the agent will modify his plan at most $k$ times along the way. We quantify this simplicity in the time-inconsistency model as a structural parameter: The number of branching vertices (vertices with out-degree at least $2$) in a minimal motivating subgraph. Our results are as follows: We give a linear algorithm for finding an optimal motivating path, i.e. when $k=0$. On the negative side, we show that finding a simple motivating subgraph is NP-complete even if we allow only a single branching vertex --- revealing that simple motivating subgraphs are indeed hard to find. However, we give a pseudo-polynomial algorithm for the case when $k$ is fixed and edge weights are rationals, which might be a reasonable assumption in practice.

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

↑