Abstract: In 2002, Kar characterized the Shapley value on minimum cost spanning tree games by using four axioms: efficiency, absence of cross subsidization, group independence, and equal treatment. This paper introduces a new axiom, called “group efficiency”. Combining it with “equal treatment”, we propose a new characterization of the Shapley value on minimum cost spanning tree games. Finally, we analyze the allocation of network service cost by the Shapley value on minimum cost spanning tree games.

Key words: minimum cost spanning tree game, Shapley value, group efficiency, equal treatment

摘要： 2002年,Kar利用有效性、无交叉补贴性、群独立性和等处理性四个公理对最小成本生成树对策上的Shapley值进行了刻画。本文提出了“群有效性”这一公理,利用这一公理和“等处理性”两个公理,给出了最小成本生成树对策上Shapley值的一种新的公理化刻画。最后,运用最小成本生成树对策的Shapley值,对网络服务的费用分摊问题进行了分析。

关键词: 最小成本生成树对策, Shapley值, 群有效性, 等处理性