Use of Genetic Algorithms to Solve Game Problems with Coalition Structure

Shaura A.S.


The possibility of using evolutionary computing to solve games theory problems with coalition structure is considered. The algorithm for solving such problems is proposed as well as a way to find a "fair" division among the members of the coalition, based on the distribution of the players reward in proportion to their useful deposition to the overall coalitions reward. The algorithm is demonstrated by the example of finding the optimal structure and the distribution of reward between players.


alliance games; genetic algorithm; division; optimal structure

References References

Оуэн Г. Теория игр / пер. с англ. И. Н. Врублевская и др. : под ред. А. А. Корбут ; вступ. ст. Н. Н. Воробьев. - М. : Мир, 1971. - 230 с. URL: (дата обращения: 03.05.2011).

Воробьев Н. Н. Коалиционные игры // Теория вероятности и ее применение. - 1967. - Т. 12, вып. 2. - С. 289-306.

Воробьев Н. Н. Теория игр для экономистов-кибернетиков. - М. : Наука, 1985. - 272 с. URL: ru/files/5468603 (дата обращения: 03.05.2011).

Article Metrics

Metrics Loading ...

Metrics powered by PLOS ALM


  • There are currently no refbacks.

Copyright (c) 2011 Александр Сергеевич Шаура

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 1813-7911