Synthesizing safe coalition strategies

Nathalie Bertrand (1) , Patricia Bouyer (2) , Anirban Majumdar (2, 1)

1 SUMO - SUpervision of large MOdular and distributed systems
2 LSV - Laboratoire Spécification et Vérification

Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent games with an arbitrary number of agents, and study the problem of synthesizing a coalition strategy to achieve a global safety objective. The problem is non-trivial since the agents do not know a priori how many they are when they start the game. We prove that the existence of a safe arbitrary-large coalition strategy for safety objectives is a PSPACE-hard problem that can be decided in exponential space. 2012 ACM Subject Classification Theory of computation → Verification by model checking

Mots clés: and phrases concurrent games; parameterized verification; strategy synthesis

Domaines: Informatique [cs]; Logique en informatique [cs.LO]; Calcul parallèle, distribué et partagé [cs.DC]

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Synthesizing safe coalition strategies. FSTTCS'20, Dec 2020, on line, India. ⟨hal-02917538⟩