网格状有向图上的部分合作对策  

Partial Cooperative Game on Mesh-like Directed Graph

作　　者：高红伟[1] 王桂熙[1] 杨慧敬[1] 于琨[1] 

机构地区：[1]青岛大学数学科学学院,青岛266071

出　　处：《应用数学学报》2010年第1期161-170,共10页Acta Mathematicae Applicatae Sinica

基　　金：国家自然科学基金(70571040;70871064);国家自然科学基金国际(地区)合作交流(70711120204);山东省研究生教育创新计划(SDYC08045)资助项目

摘　　要：本文通过在有向图上每个状态结点处定义合作函数,运用Berge C的关于图上对策中策略的概念,在网格状有向图上考察部分合作动态对策.局中人在对策进程中将采取部分合作而不是完全合作,部分合作的主要特征是每个局中人的行为是合作行动与单独行动的组合.本文合作函数的设定允许局中人加入某个联盟之后再脱离该联盟,同时给出了有向图上部分合作对策的值、最优路径的算法及示例.In this paper, the partial cooperative game on mesh-like directed graph has been researched, by defining the cooperative function on each state node of the directed graph and applying the concept of strategy in graph-game constructed by Berge C. During the process of the game, players take partial cooperative behavior instead of the complete cooperative one. The main character of partial cooperative game is that each player＇s behavior is a combination of cooperative one and individual one. In this paper, players are permitted to leave the coalition after joining it. Also, on directed graph, the value of partial cooperative games, the algorithm for constructing the optimal path, and some illustrations are given.

关 键 词：有向图 简单策略 部分合作 特征函数 动态联盟 

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