Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

DOI10.1016/J.DAM.2011.07.020MaRDI QIDQ423895zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Justo Puerto, Arie Tamir, Federico Perea

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

zbMATH Keywords

diametercooperative combinatorial gamescore solutions

Mathematics Subject Classification ID

Cooperative games (91A12) Combinatorial games (91A46)

Recommendations

• A cooperative location game based on the 1-center location problem
• On the core of the minimum cost Steiner tree game in networks
• Cooperative games in facility location situations with regional fixed costs
• Cooperative facility location games
• On the Core of Cost Allocation Games Defined on Location Problems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3257031 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A cooperative location game based on the 1-center location problem
• A note on the 5-person traveling salesman game
• A unifying location model on tree graphs based on submodularity property
• Algorithmic Game Theory
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Cooperative facility location games
• Cores of convex games
• Cost allocation for a spanning tree
• Generalized Network Problems Yielding Totally Balanced Games
• 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 Core of Cost Allocation Games Defined on Location Problems
• On the computation of the nucleolus of a cooperative game
• On the core and nucleolus of minimum cost spanning tree games
• On the core of a class of location games
• On the core of a traveling salesman cost allocation game
• On the core of linear production games
• On the core of network synthesis games
• On the minimum diameter spanning tree problem
• Operations research games: A survey. (With comments and rejoinder)
• The Nucleolus as a Solution of a Minimization Problem
• The Role of Cost Allocation in Locational Models
• The assignment game. I: The core
• Transfers, contracts and strategic games

Cited in

(6)

• Cooperative facility location games
• Computing Shapley values in the plane
• Open problems in cooperative location games
• A cooperative location game based on the 1-center location problem
• 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: Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423895)