RUS  ENG
Полная версия
ЖУРНАЛЫ // Contributions to Game Theory and Management // Архив

Contributions to Game Theory and Management, 2019, том 12, страницы 100–112 (Mi cgtm337)

A note on four-players triple game

Rentsen Enkhbata, Sukhee Batbilegb, Anton Anikinc, Natsagdorj Tungalaga, Alexander Gornovc

a National University of Mongolia, School of Business, Ikh toiruu-4, Ulaanbaatar, Mongolia
b National University of Mongolia, School of Engineering and Applied Sciences, Ikh Surguuliin-1 P.O.BOX-46A/523, 14201, Ulaanbaatar, Mongolia
c Matrosov Institute for System Dynamics and Control, Theory of Siberian Branch of Russian Academy of Sciences, Russia, 664033, Irkutsk, Lermontova st., 134

Аннотация: 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).

Ключевые слова: nonconvex optimization, four-players triple game, local and global search algorithm, Nash equilibrium.

Язык публикации: английский



© МИАН, 2024