Relationships between Bankruptcy Games and Minimum Cost Spanning Tree Games

摘要

The cost allocation problem of setting charges to the users in a given network isconsidered 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 aim is 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 conditions of the estate and the claims which are sufficient and necessary for the repsentation of bankruptcy games as minimum cost spanning tree games are provided. A particular cost allocation rule for the minimum cost spanning tree allocation problem is shown to agree with a certain division rule for the bankruptcy problem.