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

不完全信息下战略能力的不动点近似

Fixpoint Approximation of Strategic Abilities under Imperfect Information

Polish Academy of Sciences(波兰科学院)

Wojciech Jamroga, Michał Knapik, Damian Kurpiewski

摘要:

不完全信息下战略能力的模型检验是一个困难的问题。复杂性的结果范围从NP完全性到不可判定性,这取决于问题的精确设置。同样重要的是,不动点等价一般不适用于不完全信息策略,这严重阻碍了获胜策略的增量合成。在本文中,我们提出了翻译的ATLir公式,提供其真值的下限和上限,并比原来的规格更便宜的验证。也就是说,如果表达式被验证为真,那么ATLir的相应公式在给定模型中也应该成立。我们首先展示直接方法不起作用的地方。然后,我们提出如何修改它以获得有保证的下界。为此,我们改变了下一步的运营商在这样一种方式,遍历一个人的不可分割的关系被视为原子活动。最有趣的是,下近似值是由一个不动点表达式提供的,该表达式使用了下一步能力运算符的非标准变体。我们的翻译的正确性,建立其计算复杂性,并通过实验验证的方法与一个可扩展的情况下,桥发挥。

英文摘要:

Model checking of strategic ability under imperfect information is known to be hard. The complexity results range from NP-completeness to undecidability, depending on the precise setup of the problem. No less importantly, fixpoint equivalences do not generally hold for imperfect information strategies, which seriously hampers incremental synthesis of winning strategies. In this paper, we propose translations of ATLir formulae that provide lower and upper bounds for their truth values, and are cheaper to verify than the original specifications. That is, if the expression is verified as true then the corresponding formula of ATLir should also hold in the given model. We begin by showing where the straightforward approach does not work. Then, we propose how it can be modified to obtain guaranteed lower bounds. To this end, we alter the next-step operator in such a way that traversing one's indistinguishability relation is seen as atomic activity. Most interestingly, the lower approximation is provided by a fixpoint expression that uses a nonstandard variant of the next-step ability operator. We show the correctness of the translations, establish their computational complexity, and validate the approach by experiments with a scalable scenario of Bridge play.

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

↑