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

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