The irreducible Core of a minimum cost spanning tree game
The irreducible Core of a minimum cost spanning tree game
复制标题
DOI：
10.1007/bf01414212
复制
发表时间：
1993-06
期刊：
影响因子：
--
通讯作者：
Harry Aarts;T. Driessen
中科院分区：
文献类型：
--
作者：
Harry Aarts;T. Driessen
已知的结果是，对于最小成本生成树（mcst）游戏，核心分配可以直接从底层网络中的mcst推导出。为了确定该核心分配，只需要确定网络中的mcst，而不需要计算相应mcst游戏的联盟值。在本文中，我们将直接从网络中推导出其他核心分配，而不确定相应的mcst游戏本身：我们使用Bird的想法（参见。[4])提出了两个程序，确定一部分的核心（称为不可约核心）从网络。
It is a known result that for a minimum cost spanning tree (mcst) game a Core allocation can be deduced directly from a mcst in the underlying network. To determine this Core allocation one only needs to determine a mcst in the network and it is not necessary to calculate the coalition values of the corresponding mcst game. In this paper we will deduce other Core allocations directly from the network, without determining the corresponding mcst game itself: we use an idea of Bird (cf. [4]) to present two procedures that determine a part of the Core (called the Irreducible Core) from the network.