Improved Bounds for Facility Location Games with Fair Cost Allocation

DOI10.1007/978-3-642-02026-1_16MaRDI QIDQ3637064zbMATH OpenOpenAlexFDO

Authors Thomas Dueholm Hansen, Orestis A. Telelis

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_16

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Non-cooperative facility location and covering games
• Non-cooperative Facility Location and Covering Games
• scientific article; zbMATH DE number 1445290
• Strategy-proof mechanisms for facility location games with many facilities
• Cooperative facility location games

Cited in

(12)

• On approximately fair cost allocation in Euclidean TSP games
• Bounding quality of pure Nash equilibria in dual-role facility location games
• A cross-monotonic cost-sharing scheme for the concave facility location game
• Constrained heterogeneous facility location games with max-variant cost
• Non-cooperative capacitated facility location games
• Cooperative facility location games
• scientific article; zbMATH DE number 1445290 (Why is no real title available?)
• Efficient black-box reductions for separable cost sharing
• Efficient black-box reductions for separable cost sharing
• On the Core of Cost Allocation Games Defined on Location Problems
• Facility assignment with fair cost sharing: equilibrium and mechanism design
• Cross-monotonic cost sharing methods for connected facility location games

This page was built for publication: Improved Bounds for Facility Location Games with Fair Cost Allocation

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