In turn-based games played on graphs, the constrained existence problem of equilibria is a well studied problem. This problem is already known to be decidable in P for weak subgame perfect equilibria in Boolean games with Büchi objectives. In this paper, we prove that this problem is P-complete.

中文翻译：

---

多人布奇游戏中弱子游戏完美平衡的存在约束

在基于回合的图形游戏中，均衡的约束存在问题是一个经过充分研究的问题。对于具有布奇目标的布尔博弈中的弱子博弈完美平衡，在P中可以确定该问题是可以确定的。在本文中，我们证明了这个问题是P完全的。