IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-2648-2_5.html
   My bibliography  Save this book chapter

Relationships Between Bankruptcy Games and Minimum Cost Spanning Tree Games

In: Essays in Game Theory

Author

Listed:
  • Theo S. H. Driessen

    (University of Twente, Department of Applied Mathematics)

Abstract

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. Finally, it is shown that a particular cost allocation rule for the minimum cost spanning tree allocation problem agrees with a certain division rule for the bankruptcy problem.

Suggested Citation

  • Theo S. H. Driessen, 1994. "Relationships Between Bankruptcy Games and Minimum Cost Spanning Tree Games," Springer Books, in: Nimrod Megiddo (ed.), Essays in Game Theory, chapter 0, pages 51-64, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-2648-2_5
    DOI: 10.1007/978-1-4612-2648-2_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-2648-2_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.