A note on maximal covering location games

DOI10.1016/j.orl.2016.12.006zbMath1409.91055OpenAlexW2563644424MaRDI QIDQ1727959

Marco Slikker, Geert-Jan van Houtum, Loe Schlicher

Publication date: 21 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/7891e9ae-e428-4078-a064-8f068b52f6ab

zbMATH Keywords

corecooperative gamemaximal covering location problem

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Other game-theoretic models (91A40)

Related Items

Probabilistic resource pooling games, Resource location games, Set-weighted games and their application to the cover problem

Cites Work

• Unnamed Item
• Aggregation without loss of optimality in competitive location models
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• On the Core of Cost Allocation Games Defined on Location Problems