A Note on Four-Players Triple Game
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
Downloads
References
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.