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

随机多智能体系统中的自然策略能力

Natural Strategic Ability in Stochastic Multi-Agent Systems

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

AI总结:

本文提出在随机多智能体系统中使用自然策略框架,分析了 NatPATL 和 NatPATL* 的模型检查复杂性,展示了在确定性策略限制下 NatPATL 的 NP 完全性和 NatPATL* 的 2NEXPTIME 复杂性。

摘要:

使用形式化方法合成的策略通常复杂且需要无限记忆,这在尝试建模多智能体系统(MAS)时与预期行为不一致。为捕捉此类行为,自然策略是一种最近提出的方法,它在智能体利用记忆进行策略制定的能力和模型检查复杂性之间取得平衡,但迄今为止仅限于完全确定性设置。首次,我们考虑在自然策略(NatPATL 和 NatPATL*)下使用概率时序逻辑 PATL 和 PATL*。主要结果是,在随机 MAS 中,当活跃联盟被限制为确定性策略时,NatPATL 的模型检查是 NP 完全的。我们还给出了 NatPATL* 在相同限制下的 2NEXPTIME 复杂性结果。在无限制情况下,我们给出了 NatPATL 的 EXPSPACE 复杂性以及 NatPATL* 的 3EXPSPACE 复杂性。

英文摘要:

Strategies synthesized using formal methods can be complex and often require infinite memory, which does not correspond to the expected behavior when trying to model Multi-Agent Systems (MAS). To capture such behaviors, natural strategies are a recently proposed framework striking a balance between the ability of agents to strategize with memory and the model-checking complexity, but until now has been restricted to fully deterministic settings. For the first time, we consider the probabilistic temporal logics PATL and PATL* under natural strategies (NatPATL and NatPATL*, resp.). As main result we show that, in stochastic MAS, NatPATL model-checking is NP-complete when the active coalition is restricted to deterministic strategies. We also give a 2NEXPTIME complexity result for NatPATL* with the same restriction. In the unrestricted case, we give an EXPSPACE complexity for NatPATL and 3EXPSPACE complexity for NatPATL*.

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

↑