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 undeci...

Table 1: Document Conventions x arena frame x position y arena frame y position z arena frame z position ẋ arena frame x velocity ẏ arena frame y velocity ż arena frame z velocity ẍ arena frame x acceleration ÿ arena frame y acceleration z̈ arena frame z acceleration xB vehicle frame x position yB vehicle frame y position zB vehicle frame z position ẋB vehicle frame x velocity ẏB vehicle frame y...

Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turnbased or concurrent moves, and deterministic or stochastic transitions. In this paper, we are inte...