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

如何引导具有现时偏好的智能体完成规定任务?

How to guide a present-biased agent through prescribed tasks?

Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev

AI总结:

针对现时偏好智能体的委托-代理问题,基于Kleinberg和Oren的图论模型,利用参数化复杂度工具研究通过增删任务修改项目以引导智能体选择重要任务且避免其放弃项目的策略,并提供了相应的算法与复杂度界限。

摘要:

现时偏好是一种有充分记录的行为特征,对人类决策产生重大影响,具有现时偏好的智能体通常将即时奖励置于长期利益之上,导致在各种现实场景中出现次优结果。Kleinberg和Oren (2014) 提出了一个流行的非一致规划图论模型,以捕捉现时偏好智能体的行为。在该模型中,多步骤项目由加权有向无环任务图表示,智能体根据现时偏好遍历该图。我们使用Kleinberg和Oren的模型来解决委托-代理问题,其中完全了解智能体现时偏好的委托人,旨在通过添加或删除任务来修改现有项目。挑战在于创建一个满足两个略显矛盾条件的修改后项目。一方面,具有现时偏好的智能体应选择委托人认为重要的特定任务。另一方面,如果修改后项目中的预期成本对智能体而言过高,则存在智能体放弃整个项目的风险,这不符合委托人的利益。为了解决这一问题,我们利用参数化复杂度工具研究是否能够高效识别委托人的策略。我们针对该问题提供了算法和复杂度界限。

英文摘要:

The present bias is a well-documented behavioral trait that significantly influences human decision-making, with present-biased agents often prioritizing immediate rewards over long-term benefits, leading to suboptimal outcomes in various real-world scenarios. Kleinberg and Oren (2014) proposed a popular graph-theoretical model of inconsistent planning to capture the behavior of present-biased agents. In this model, a multi-step project is represented by a weighted directed acyclic task graph, where the agent traverses the graph based on present-biased preferences. We use the model of Kleinberg and Oren to address the principal-agent problem, where a principal, fully aware of the agent's present bias, aims to modify an existing project by adding or deleting tasks. The challenge is to create a modified project that satisfies two somewhat contradictory conditions. On one hand, the present-biased agent should select specific tasks deemed important by the principal. On the other hand, if the anticipated costs in the modified project become too high for the agent, there is a risk of the agent abandoning the entire project, which is not in the principal's interest. To tackle this issue, we leverage the tools of parameterized complexity to investigate whether the principal's strategy can be efficiently identified. We provide algorithms and complexity bounds for this problem.

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

↑