Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
From MaRDI portal
Publication:423895
DOI10.1016/j.dam.2011.07.020zbMath1238.91042OpenAlexW2166104187WikidataQ58217172 ScholiaQ58217172MaRDI QIDQ423895
Justo Puerto, Federico Perea, Arie Tamir
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.020
Related Items
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, Unnamed Item, A cooperative location game based on the 1-center location problem, OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES, Computing Shapley values in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Transfers, contracts and strategic games
- On the minimum diameter spanning tree problem
- On the core of network synthesis games
- On the core of a traveling salesman cost allocation game
- A unifying location model on tree graphs based on submodularity property
- Operations research games: A survey. (With comments and rejoinder)
- On the core of a class of location games
- On the computation of the nucleolus of a cooperative game
- A cooperative location game based on the 1-center location problem
- Cores of convex games
- The assignment game. I: The core
- New techniques for cost sharing in combinatorial optimization games
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A note on the 5-person traveling salesman game
- On the core and nucleolus of minimum cost spanning tree games
- The Role of Cost Allocation in Locational Models
- Minimum cost spanning tree games
- Generalized Network Problems Yielding Totally Balanced Games
- On the core of linear production games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cooperative facility location games
- On the Core of Cost Allocation Games Defined on Location Problems
- Algorithmic Game Theory
- The Nucleolus as a Solution of a Minimization Problem
