Abstract: Among the existing methods for computing the Nash Equilibrium of graphical games, agents play discretized mixed Strategies. Consequently, only an approximate Nash Equilibrium can be achieved. In this paper, we induce the problem of obtaining an exact Nash

Key words: Multi-agent interaction model, Graphical game, Nash equilibrium, Linear programming, Gradient descent algorithms