Minimum cost forest games

Minimum cost forest games

0.00 Avg rating0 Votes
Article ID: iaor19982907
Country: Germany
Volume: 26
Issue: 3
Start Page Number: 367
End Page Number: 377
Publication Date: Jan 1997
Journal: International Journal of Game Theory
Authors:
Keywords: networks: path
Abstract:

In this paper we consider a generalization of the minimum cost spanning tree game. The generalized model allows for more than one supplier, where each supplier offers a different type of service to the customers 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 one customer who wants to be connected to all suppliers. Furthermore, the core is always non-empty if there are at most two suppliers.

Reviews

Required fields are marked *. Your email address will not be published.