Detecting Strong Berge Pareto equilibrium in a non-cooperative game using an evolutionary approach

Abstract

Nash equilibrium is an important solving concept in Game Theory. Playing in Nash sense means that no player (agent) wants to deviate from the equilibrium strategy in order to increase the payoff. Some games can have more Nash equilibria. Several refinements have been developed. Strong Berge Pareto equilibrium is an important refinement of the Nash equilibrium. An evolutionary technique based on non-domination is proposed in order to detect the strong Berge Pareto equilibria. Some numerical experiments are presented in order to illustrate the proposed method.