2020/08/09 by Nathalie Bertrand, Bertrand, Nathalie, Patricia Bouyer +3 · 1 citation
Economics, Econometrics and Finance · #FOS: Computer and information sciences #Game Theory and Voting Systems #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.2008.03770
openalex publication_date 2020/08/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.