A generalized linear production model: A unifying model
Mathematical Programming: Series A and B
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
The role of cost allocation in locational models
Operations Research
On the core of network synthesis games
Mathematical Programming: Series A and B
A unifying location model on tree graphs based on submodularity properties
Discrete Applied Mathematics
On the complexity of cooperative solution concepts
Mathematics of Operations Research
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory
Computing the nucleolus of min-cost spanning tree games is NP-hard
International Journal of Game Theory
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research
On the computation of the nucleolus of a cooperative game
International Journal of Game Theory
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
On the minimum diameter spanning tree problem
Information Processing Letters
| Hi-index | 0.01 |
In this paper we introduce and analyze new classes of cooperative games related to facility location models defined on general metric spaces. 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 either the service radius or the 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, and on finite dimension vector spaces endowed with a norm (Rd).