Solving Nash Equilibrium for N-Persons'Non-Cooperative Game Based on Mayfly Algorithm
In view of the limitation of the convex optimization algorithm in solving the Nash equilibrium of a non-cooperative game,the Nash equilibrium of an N-person non-cooperative game is an NP problem,an improved bionic algorithm for solving the Nash equilibrium of an N-person non-cooperative game,Mayfly algorithm(MA),is pro-posed.In this algorithm,Mayfly searches for the optimal solution by adjusting the position through the individual opti-mal position and the overall optimal position,and introduces the Gaussian mutation operator to improve the search a-bility of the algorithm.According to the characteristics that the solution space of Nash equilibrium is simplex,the fixed initialization point and random initialization point are combined to improve the search speed and the results are not limited to pure strategy.Experiments show that the Mayfly algorithm is better than the fireworks algorithm and im-mune particle swarm algorithm in solving Nash equilibrium,especially for high dimensional game problems.
NETL
NSTL
万方数据
