A note on anti-Berge equilibrium for bimatrix game

We introduce a new concept of equilibrium based on Nash and Berge equilibriums. This equilibrium is called Anti-Berge equilibrium. We prove an existence of Anti-Berge equilibrium in the game. Based on Mills theorem [9], we reduce finding Anti-Berge equilibrium to a quadratic programming problem with linear constraints. The proposed approach has been illustrated on an example.