A cooperative location game based on the 1-center location problem
From MaRDI portal
Publication:2275823
Recommendations
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Cooperative games in facility location situations with regional fixed costs
- On the Core of Cost Allocation Games Defined on Location Problems
- A Class of Location Games with Type Dependent Facilities
- On the core of a class of location games
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Diameter-preserving spanning trees in sparse weighted graphs
- Metric spaces, convexity and nonpositive curvature
- Minimum cost spanning tree games
- New techniques for cost sharing in combinatorial optimization games
- On cost allocation for a spanning tree: A game theoretic approach
- On the complexity of testing membership in the core of min-cost spanning tree games
- On the core and nucleolus of minimum cost spanning tree games
- On the core of a class of location games
- On the core of network synthesis games
- On the minimum diameter spanning tree problem
- The structure of median graphs
Cited in
(10)- A note on maximal covering location games
- The geometry of optimal partitions in location problems
- Computing Shapley values in the plane
- Simultaneous penalization and subsidization for stabilizing grand cooperation
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Open problems in cooperative location games
- Cooperative approach to a location problem with agglomeration economies
- scientific article; zbMATH DE number 7559220 (Why is no real title available?)
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
This page was built for publication: A cooperative location game based on the 1-center location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275823)