Strategy logic with simple goals: Tractable reasoning about strategies

Francesco Belardinelli (1, 2) , Wojciech Jamroga (3, 4) , Vadim Malvone (2) , Aniello Murano (5)

1 Imperial College London
2 IBISC - Informatique, BioInformatique, Systèmes Complexes
3 Institute of Computer Science
4 SnT - Interdisciplinary Centre for Security, Reliability and Trust
5 University of Naples Federico II = Università degli studi di Napoli Federico II

In this paper we introduce Strategy Logic with Simple Goals (SL[SG]), a fragment of Strategy Logic that strictly extends Alternating-time Temporal Logic ATL by introducing arbitrary quantification over the agents' strategies. Our motivation comes from game-theoretic applications, such as expressing Stackelberg equilibria in games, coercion in voting protocols, as well as module checking for simple goals. We prove that model checking SL[SG] is P-complete, the same as ATL. Thus, the extra expressive power comes at no computational cost as far as verification is concerned.

Domaines: Calcul formel [cs.SC]; Théorie et langage formel [cs.FL]

Francesco Belardinelli, Wojciech Jamroga, Vadim Malvone, Aniello Murano. Strategy logic with simple goals: Tractable reasoning about strategies. 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), Aug 2019, Macao, China. pp.88--94. ⟨hal-02377403⟩