中文摘要：

在合作对策中，将一个值规范化意味着让其满足有效性．Hamiache利用矩阵方法得到了带图结构效用可转移合作对策Myerson值的一种规范化．通过给出一种新的满足最小划分唯一性的集合簇，本文利用矩阵方法得到了Myerson值的另一种规范化．特殊地，当所考虑的图结构在各连通分支上的限制均为完全图时，文中给出了带联盟结构效用可转移合作对策Aumann—Dreze值的一种规范化．与其它Myerson值规范化的比较分析表明本文规范化与vandenBrink等的等价．由此vandenBrink等的规范化与Hamiache的规范化都可用矩阵方法来描述，而它们之间的区别则被归结于满足最小划分唯一性的集合簇之不同．

英文摘要：

In cooperative game theory, normalizing a value means making it to be efficient. Hamiache obtains a normalization of the Myerson value for transferable utility cooperative games with a graph structure via the matrix approach. By giving a new collection of sets satisfying unique minimal partition property, this paper proposes another normalization of the Myerson value also with the matrix approach. Particularly, if the restriction of the graph on every component is complete, then a normalization of the Aumann-Drèze value for transferable utility cooperative games with a coalition structure is proposed. Comparative analysis with other normalization of the Myerson value shows that the one proposed in the paper is equivalent to the one of van den Brink et M. Thus both the normalization of van den Brink et al and of Hamiache can be represented by the matrix approach, and the difference between them is pinpointed to the collection of sets satisfying unique minimal partition property.