  We investigate a model for representing large multiplayer games, which
satisfy strong symmetry properties. This model is made of multiple copies of an
arena; each player plays in his own arena, and can partially observe what the
other players do. Therefore, this game has partial information and symmetry
constraints, which make the computation of Nash equilibria difficult. We show
several undecidability results, and for bounded-memory strategies, we precisely
characterize the complexity of computing pure Nash equilibria (for qualitative
objectives) in this game model.
