Natural Strategic Ability in Stochastic Multi-Agent Systems
Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano
Abstract
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 complexity of the model-checking problem, 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∗). 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*.
BibTeX
@article{Berthon_Katoen_Mittelmann_Murano_2024, title={Natural Strategic Ability in Stochastic Multi-Agent Systems}, volume={38}, url={https://ojs.aaai.org/index.php/AAAI/article/view/29678}, DOI={10.1609/aaai.v38i16.29678}, abstractNote={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 complexity of the model-checking problem, 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∗). 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*.}, number={16}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Berthon, Raphaël and Katoen, Joost-Pieter and Mittelmann, Munyque and Murano, Aniello}, year={2024}, month={Mar.}, pages={17308-17316} }