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

Justo Puerto*, Arie Tamir, Federico Perea

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)970-979
Number of pages10
JournalDiscrete Applied Mathematics
Volume160
Issue number7-8
DOIs
StatePublished - May 2012

Keywords

  • Cooperative combinatorial games
  • Core solutions
  • Diameter

Fingerprint

Dive into the research topics of 'Cooperative location games based on the minimum diameter spanning Steiner subgraph problem'. Together they form a unique fingerprint.

Cite this