Abstract:
We introduce so-called four-players triple game and define Nash equilibrium. The problem of numerical finding of a Nash equilibrium in a four-players triple game has been examined. Such a game can be completely described by twelve matrices, and it turns out to be equivalent to the solving a nonconvex optimization problem. Special methods of local and global search for the optimization problem are proposed. The proposed algorithm was implemented on test problems by "GAMUT" (http://gamut.stanford.edu).
Keywords:nonconvex optimization, four-players triple game, local and global search algorithm, Nash equilibrium.