Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is the service diameter of the coalition.We study the existence of core allocations for these games, focusing on network spaces, i.e., finite metric spaces induced by undirected graphs and positive edge lengths.

► New classes of cooperative games related to facility location models.
► The characteristic value of a coalition is the service diameter of its points.
► Existence of core allocations for these Games are studied, focusing on finite metric spaces induced by undirected graphs and positive edge lengths.
► For games defined on tree networks, Shapley value and core description are obtained in polynomial time.