The irreducible core of a minimum cost spanning tree game

Harry Aarts, Theo Driessen

    Research output: Book/ReportReportProfessional

    19 Citations (Scopus)

    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
    Place of PublicationEnschede
    PublisherUniversity of Twente, Faculty of Mathematical Sciences
    Number of pages13
    Publication statusPublished - 1993

    Publication series

    NameMemorandum
    PublisherUniversity of Twente, Faculty of Mathematical Sciences
    No.1133

    Keywords

    • METIS-142606

    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

    Aarts, H., & Driessen, T. (1993). The irreducible core of a minimum cost spanning tree game. (Memorandum; No. 1133). Enschede: University of Twente, Faculty of Mathematical Sciences.