论文标题
综合安全联盟策略
Synthesizing safe coalition strategies
论文作者
论文摘要
与固定代理的并发游戏已经进行了彻底的研究，并为代理商提供了各种解决方案概念和目标。在本文中，我们考虑与任意数量的代理商的并发游戏，并研究综合联盟战略以实现全球安全目标的问题。这个问题是非平凡的，因为代理商不知道他们在开始游戏时有多少。我们证明，安全目标的安全任意大型联盟策略的存在是一个可以在指数空间中决定的问题。
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.
