Natural Strategic Ability in Stochastic Multi-Agent Systems

Authors: Raphaƫl Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

AAAI 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical For the first time, we consider the probabilistic temporal logics PATL and PATL under natural strategies (Nat PATL and Nat PATL , resp.). As main result we show that, in stochastic MAS, Nat PATL model-checking is NP-complete when the active coalition is restricted to deterministic strategies. We also give a 2NEXPTIME complexity result for Nat PATL with the same restriction. In the unrestricted case, we give an EXPSPACE complexity for Nat PATL and 3EXPSPACE complexity for Nat PATL .
Researcher Affiliation Academia 1 RWTH Aachen University, Germany 2 University of Naples Federico II, Italy
Pseudocode No The paper does not include any explicitly labeled 'Pseudocode' or 'Algorithm' blocks, nor does it present any structured code-like procedures.
Open Source Code No The paper does not contain any statements about releasing source code or provide links to a code repository.
Open Datasets No The paper presents theoretical work and uses illustrative examples, but does not describe the use of any publicly available datasets for empirical evaluation, nor does it provide access information for any data.
Dataset Splits No The paper is theoretical and does not describe any experimental setup involving dataset splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and does not describe any experimental setup that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not describe any experimental setup that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe any experimental setup, hyperparameters, or training configurations.