Relationships between bankruptcy games and minimum cost spanning tree games

Theo S.H. Driessen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


    The cost allocation problem of setting charges to the users in a given network is considered with the aid of minimum cost spanning trees in the network. In addition, the bankruptcy problem of dividing the estate of the bankrupt concern among the various creditors according to their claims is treated. The paper aims to establish that, under certain circumstances, the bankruptcy problem can be seen as a minimum cost spanning tree allocation problem. In the game theoretic setting, the paper provides the conditions on the estate and the claims which are sufficient and necessary for the representation of bankruptcy games as minimum cost spanning tree games.
    Original languageEnglish
    Title of host publicationOperations Research ’92
    Subtitle of host publicationExtended Abstracts of the 17th Symposium on Operations Research held at the Universität der Bundeswehr Hamburg at August 25–28, 1992
    EditorsAlexander Karmann, Karl Mosler, Martin Schader, Götz Uebe
    Place of PublicationHeidelberg
    Number of pages3
    ISBN (Electronic)978-3-662-12629-5
    ISBN (Print)978-3-7908-0679-3
    Publication statusPublished - 18 Jan 1993


    Dive into the research topics of 'Relationships between bankruptcy games and minimum cost spanning tree games'. Together they form a unique fingerprint.

    Cite this