2014/04/03 by Patricia Bouyer, Nicolas Markey, Steen Vester
Computer Science · #cs.GT #cs.LO
paper · pdf · doi:10.4204/eptcs.146.7
published as EPTCS 146, 2014, pp. 49-55 · In Proceedings SR 2014, arXiv:1404.0414
arxiv created 2014/04/03 · arxiv updated 2014/04/04
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.