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

论理性验证的复杂性

On the Complexity of Rational Verification

Monash University(莫纳什大学);University of Kaiserslautern(凯泽斯劳滕大学);Sapienza University of Rome(罗马第一大学);University of Oxford(牛津大学)

Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge

摘要:

理性验证是指检查并发多智能体系统的时间逻辑属性的问题,假设系统中的代理选择形成博弈论均衡的策略。理性验证可以被理解为多智能体系统的模型检验的对应物,但是虽然经典的模型检验可以在多项式时间内完成一些时态逻辑规约语言,如CTL,多项式空间与LTL规范,理性验证要困难得多:理性验证的关键决策问题是2 EXPTIME-完全与LTL规范,即使使用显式状态系统表示。在此背景下,我们在本文中的贡献是三方面的。首先,我们表明,合理验证的复杂性可以大大降低限制规格GR(1),一个片段的LTL,可以代表一个广泛的和实际有用的一类反应系统的响应特性。特别是,我们表明,对于一些相关的设置,合理的验证可以在多项式空间,甚至在多项式时间。其次,我们提供了改进的复杂性结果,合理的验证时,考虑球员的目标给出的平均回报效用函数,可以说是最广泛使用的方法,在并发和多智能体系统的定量目标。最后,我们考虑了满足社会福利约束的计算结果的问题。为此,我们考虑功利主义和平等主义的社会福利,并表明计算这样的结果是PSPACE完全或NP完全。

英文摘要:

Rational verification refers to the problem of checking which temporal logic properties hold of a concurrent multiagent system, under the assumption that agents in the system choose strategies that form a game-theoretic equilibrium. Rational verification can be understood as a counterpart to model checking for multiagent systems, but while classical model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is much harder: the key decision problems for rational verification are 2EXPTIME-complete with LTL specifications, even when using explicit-state system representations. Against this background, our contributions in this paper are threefold. First, we show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1), a fragment of LTL that can represent a broad and practically useful class of response properties of reactive systems. In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space and even in polynomial time. Second, we provide improved complexity results for rational verification when considering players' goals given by mean-payoff utility functions; arguably the most widely used approach for quantitative objectives in concurrent and multiagent systems. Finally, we consider the problem of computing outcomes that satisfy social welfare constraints. To this end, we consider both utilitarian and egalitarian social welfare and show that computing such outcomes is either PSPACE-complete or NP-complete.

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

↑