MINIMUM-COST FOREST GAMES

In this paper we consider a generalization of the minimum cost spannin g tree game. The generalized model allows for more than one supplier, where each supplier offers a different type of service to the customer s and each customer specifies a non-empty subset of these suppliers to which he wishes to be connected. We show that the core of such a game may be empty, but that it is always non-empty if there is at least on e customer who wants to be connected to all suppliers. Furthermore, th e core is always non-empty if there are at most two suppliers.