Department of Industrial Engineering & Decision Analytics [Joint IEDA/ISOM] seminar - Global Optimization Method for the Berge Equilibrium                                         in a Bimatrix Game

This talk presents a global optimization approach for computing the Berge equilibrium in bimatrix games with mixed strategies. Although the existence of such an equilibrium has been established in previous research, its computation remains challenging due to the problem's inherent nonconvexity. We reformulate the problem within the Difference-of-Convex (D.C.) programming framework and demonstrate that it can be effectively solved using global optimization methods. The proposed approach contributes to the computational study of cooperative equilibrium in nonzero-sum games.