Use of Genetic Algorithms to Solve Game Problems with Coalition Structure

Authors

  • A. S. Shaura Izhevsk State Technical University

Keywords:

alliance games, genetic algorithm, division, optimal structure

Abstract

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.

Author Biography

A. S. Shaura, Izhevsk State Technical University

; Izhevsk State Technical University

References

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

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

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

Published

15.03.2011

How to Cite

Shaura А. С. (2011). Use of Genetic Algorithms to Solve Game Problems with Coalition Structure. Intellekt. Sist. Proizv., 6(1), 68–74. Retrieved from https://izdat.istu.ru/index.php/ISM/article/view/1771

Issue

Section

Articles