Artículo
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Autor/es | Puerto Albandoz, Justo
Tamir, Arie Perea Rojas-Marcos, Federico |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2012-05 |
Fecha de depósito | 2016-06-27 |
Publicado en |
|
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España Junta de Andalucía |
Identificador del proyecto | MTM200767433
MTM201019576 FQM5849 |
Cita | Puerto Albandoz, J., Tamir, A. y Perea Rojas-Marcos, F. (2012). Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discrete Applied Mathematics, 160 (7-8), 970-979. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Cooperative location games based ... | 215.9Kb | [PDF] | Ver/ | |