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.
|Title of host publication||Operations Research ’92|
|Subtitle of host publication||Extended Abstracts of the 17th Symposium on Operations Research held at the Universität der Bundeswehr Hamburg at August 25–28, 1992|
|Editors||Alexander Karmann, Karl Mosler, Martin Schader, Götz Uebe|
|Place of Publication||Heidelberg|
|Number of pages||3|
|Publication status||Published - 18 Jan 1993|