最大收益支撑森林对策  

On the Maximum Income Spanning Forest Games

作　　者：李文屏[1,2] 张寅生[1] 谢政[2] 王正明[2] 

机构地区：[1]北京跟踪与通信技术研究所,北京100094 [2]国防科学技术大学理学院数学与系统科学系,长沙湖南410073

出　　处：《数学进展》2013年第3期381-392,共12页Advances in Mathematics（China）

基　　金：国家自然科学基金(No.10271026);国防科大科研计划项目(No.JC12-02-05)资助

摘　　要：本文在无向图上定义了最大收益支撑森林对策.首先研究了核心的非空性和表示性,给出了核心的弱化定义;其次给出了核心中分配属于核的充要条件,并利用迭代步骤证明了核仁即为核心和核的交集;最后给出了含割点图中核仁的分解定理.The maximum income spanning forest game is defined for undirected graph in this paper. First, the non-emptiness and the representation property of the core are developed, and the simple definition of the core is presented. Second, the necessary and sufficient condition that the imputation in the core belongs to the kernel is given, and the intersection of the core and the kernel is proved to be equal to the nucleolus by iteration. Finally, the decomposition for the nucleolus is studied for graphs including cut vertexes.

关 键 词：合作对策 核心 核 核仁 T-连通 

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