The irreducible core of a minimum cost spanning tree game

Harry Aarts, Theo Driessen

Research output: Contribution to journalArticleAcademicpeer-review

119 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)163-174
Number of pages12
JournalZeitschrift für Operations Research
Volume38
Issue number2
DOIs
Publication statusPublished - 1993

Keywords

  • Marginal allocation
  • Mcst allocation
  • Irreducible Core
  • Core
  • Network
  • Minimum cost spanning tree (mcst) game
  • METIS-140356
  • IR-92531

Fingerprint Dive into the research topics of 'The irreducible core of a minimum cost spanning tree game'. Together they form a unique fingerprint.

Cite this