A generative relation for nash equilibria on symmetric action graph games

Abstract

A method to detect good approximations of Nash equilibria in Action Graph Games (games represented as graphs) based on evolutionary computation is presented in this paper. This technique can allow to represent, reason and solve symmetric games. A fitness solution based on non-domination for the search in the configuration set of an Action Graph Game is proposed.