网络对策方法与最优联盟剖分形式  

The Method of Network Games and the Form of Optimal Coalition Partition

作　　者：于涛[1,2] 高红伟[1] 王桂熙[1] 徐蜜[1] 

机构地区：[1]青岛大学数学科学学院,青岛市宁夏路308号266071 [2]中华人民共和国青岛海关技术处,青岛市西陵峡二路2号266002

出　　处：《青岛大学学报（自然科学版）》2009年第3期9-14,共6页Journal of Qingdao University(Natural Science Edition)

基　　金：国家自然科学基金资助项目:70571040;70871064;70711120204;山东省研究生教育创新计划项目:SDYC08045

摘　　要：运用网络对策理论,借助网络对策的一种特殊类型-俱乐部网络对策研究考察不完全合作的动态对策问题。具体的方式是通过在俱乐部网络上定义合作函数,从而获得局中人集合所有可能的联盟剖分形式。再将具有相应固定联盟剖分的扩展型动态对策的值作为俱乐部网络的支付,通过考察俱乐部超网中的路径占优关系,找到吸引子以及路径占优核心,最终得到"最优"的联盟剖分形式。With the aid of the special type of the network games- the club network game, the problems of incomplete cooperative dynamic games are studied by using the theory of the network games. The methods are that all potential kinds of the coalition partitions are obtained by defining the cooperative function on the club network, and that the basins of attraction and the path dominance core are found by studying the path dominance relations of the club supernetwork and by thinking the corresponding values of the dynamic games with fixed coalition partition as the payoff of the club network. As a result, the optimal coalition partition is obtained.

关 键 词：网络生成对策 联盟剖分 超网 路径占优核心 吸引子 

分 类 号：O225[理学—运筹学与控制论]