A cooperative location game based on the 1-center location problem
DOI10.1016/J.EJOR.2011.04.020zbMATH Open1218.90104DBLPjournals/eor/PuertoTP11OpenAlexW2088986755WikidataQ58217178 ScholiaQ58217178MaRDI QIDQ2275823FDOQ2275823
Authors: Justo Puerto, Federico Perea, Arie Tamir 
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/56506
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
Cooperative games (91A12) Applications of game theory (91A80) Discrete location and assignment (90B80)
Cites Work
- Minimum cost spanning tree games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- On the core and nucleolus of minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On the core of network synthesis games
- Metric spaces, convexity and nonpositive curvature
- On the complexity of testing membership in the core of min-cost spanning tree games
- Title not available (Why is that?)
- New techniques for cost sharing in combinatorial optimization games
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On the minimum diameter spanning tree problem
- On the core of a class of location games
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- The structure of median graphs
- Diameter-preserving spanning trees in sparse weighted 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
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Open problems in cooperative location games
- Cooperative approach to a location problem with agglomeration economies
- Title not available (Why is that?)
- 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)
