关键词: 图联盟博弈, 联盟结构核, 按劳分配, 谈判集, 稳定成本

Abstract: The research of coalitional structure core is an important part in the field of artificial intelligence. Especially, the research of generating the coalitional structure and its distribution that can meet the core requirement is the present primary mission. Traditional algorithms use different methods to create the coalitions, but they still have some shortcomings, for example, assuming that all coalitions can be generated and satisfy the super-additivity, ignoring the restriction of external environment on the formation of coalition. The constraint graph is used as the constraint condition of the coalition generation, the distribution according to work is taken as the initial allocation scheme, and the bargaining set and the stable cost are taken as the allocation adjustment scheme, this paper designs the SCP (stable core programming) algorithm to generate the core of coalitional structure. As an algorithm to solve the stable situation of coalitions and the core of coalitional game, it can meet the best interest expectations of all agents in coalitions and guarantees the stability of coalitional structure.

Key words: graphical coalitional game, core of graphical coalitional structure, distribution according to one??s work, bargaining set, stable cost