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.This research has been supported by the Spanish Ministry of Science and Innovation under grants MTM200767433 and MTM201019576, and by the Junta de Andalucia (Spain)/FEDER under grant FQM5849. Special thanks are due to two anonymous referees for their valuable comments and suggestions.Puerto Albandoz, J.; Tamir, A.; Perea Rojas Marcos, F. (2011). Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discrete Applied Mathematics. 160(7-8):1-10. https://doi.org/10.1016/j.dam.2011.07.020S1101607-