Irreducible Core of a Minimum Cost Spanning Tree Game

摘要

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. The paper deduces other Core allocations directly from the network, without determining the corresponding mcst game itself: it presents two procedures that determine a part of the Core (called the Irreducible Core) from the network.