A nikaido isoda-based hybrid genetic algorithm and relaxation method for finding nash equilibrium

Abstract

Nash Equilibrium (NE) plays a crucial role in game theory. The relaxation method in conjunction with the Nikaido–Isoda (NI) function, namely the NI-based relaxation method, has been widely applied to the determination of NE. Genetic Algorithm (GA) with adaptive penalty is introduced and incorporated in the original NI-based relaxation method. The GA enhances the capability in the optimization step for computing the optimum response function. The optimization of the non-convex and non-concave NI function is made possible by GA. The proposed method thus combines the advantageous feature of the GA in its optimization capability and that of the relaxation method in its implementation simplicity together. The applicability of the method is shown through the illustrative examples, including the generalized Nash Equilibrium problem with nonlinear payoff functions and coupled constraints, the game with multiple strategic variables for individual players, and the non-differentiable payoff functions. All test example results suggest the appropriate crossover and mutation rate to be 0.05 and 0.002 for use in GA. These numbers are closed to the recommended values by DeJong. The proposed method shows its capability of finding correct NEs in all test examples.