综合安全联盟策略
Synthesizing safe coalition strategies
摘要：
具有固定数量的代理的并发游戏已经被深入研究，各种解决方案的概念和目标的代理。在本文中，我们考虑并发游戏与任意数量的代理，并研究了问题的合成联盟战略，以实现全球安全目标。这个问题是不平凡的，因为代理人不知道先验有多少，他们是当他们开始游戏。我们证明了安全目标的安全任意大联盟策略的存在性是一个PSPACE困难问题，可以在指数空间中决定。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
