Relationships Between Bankruptcy Games and Minimum Cost Spanning Tree Games

Theo S. H. Driessen
Additional contact information
Theo S. H. Driessen: University of Twente, Department of Applied Mathematics

Chapter Essay 5 in Essays in Game Theory, 1994, pp 51-64 from Springer

Abstract: 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.

Keywords: Allocation Rule; Cost Allocation; Installation Cost; Division Problem; Division Rule (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2648-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461226482

DOI: 10.1007/978-1-4612-2648-2_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().