具有图限制通信结构对策的有效Owen值  

Efficient extension of the Owen value with graph-restricted communication

作　　者：单而芳[1,2] 史纪磊 吕文蓉 康丽英[2] Erfang Shan;Jilei Shi;Wenrong Lyu;Liying Kang

机构地区：[1]上海大学管理学院,上海200444 [2]上海大学数学系,上海200444 [3]宁波财经学院基础学院,宁波315175

出　　处：《中国科学：数学》2020年第9期1219-1232,共14页Scientia Sinica：Mathematica

基　　金：国家自然科学基金(批准号:11971298)资助项目。

摘　　要：Owen图值是著名的Owen值在具有图通信结构合作对策上的推广,它具有分支有效性,但失去了有效性.有效性要求在合作对策中产生的总财富恰好分配给参与的所有成员.本文提出具有有效性的Owen图值,并给出这个有效Owen图值的3种公理化刻画.最后,通过应用算例,对该值与其他值做了比较分析.The Owen graph value is a generalization of the well-known Owen value to cooperative games with graph-restricted communication. The value satisfies the property of component efficiency, but loses the property of efficiency. The efficiency requirement imposes that the total wealth generated in a cooperative game is divided among its players. In this paper we introduce an efficient extension of the Owen graph value and provide three characterizations for the efficient Owen graph value. Finally, we compare the value with other efficient values by an application example.

关 键 词：合作对策 Owen值 图 联盟结构 有效解 

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