Relationships between Bankruptcy Games and Minimum Cost Spanning Tree Games
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.
Unable to display preview. Download preview PDF.
- H.F.M. Aarts and T.S.H. Driessen (1991), A survey on minimum cost spanning tree games. Working Paper No. 1003, Department of Applied Mathematics, University of Twente, Enschede, The Netherlands.Google Scholar
- H.F.M. Aarts and T.S.H. Driessen (1992), On the core-invariance of minimum cost spanning tree games. Working paper, Department of Applied Mathematics, University of Twente, Enschede, The Netherlands.Google Scholar