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

详细信息	查看全文 | 推荐本文 |

• 作者：Justo Puerto^a ; ^puerto@us.es ; Arie Tamir^b ; Federico Perea^c
• 关键词：Cooperative combinatorial games ; Core solutions ; Diameter
• 刊名：Discrete Applied Mathematics
• 出版年：2012
• 期刊代码：46_0166218x
• 类别：cp
• 出版时间：May, 2012
• 卷：160
• 期：7-8
• 页码：970-979
• 文件大小：300 K

摘要

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.