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 computation of the nucleolus of a cooperative game
International Journal of Game Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
Algorithmic Game Theory
On the minimum diameter spanning tree problem
Information Processing Letters
New techniques for cost sharing in combinatorial optimization games
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
On the core of a traveling salesman cost allocation game
Operations Research Letters
| Hi-index | 0.04 |
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.