Symmetric graph games with partial observation pose computational challenges for Nash equilibria.
The article explores a model for representing large multiplayer games with partial observation and symmetry constraints. The researchers found that computing Nash equilibria in this game model is challenging, leading to undecidability results. They also determined the complexity of computing pure Nash equilibria for qualitative objectives with bounded-memory strategies.
