A cross-monotonic cost-sharing scheme for the concave facility location game
DOI10.1007/S10898-012-9852-0zbMATH Open1273.91247OpenAlexW2113646536MaRDI QIDQ2393059FDOQ2393059
Authors: Yu Li, Jia Shu, Gai-Di Li, Dachuan Xu 
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9852-0
Recommendations
- Cross-monotonic cost sharing methods for connected facility location games
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- Optimal cost sharing for capacitated facility location games
- A cost-sharing method for an uncapacitated facility location game with penalties
- Improved Bounds for Facility Location Games with Fair Cost Allocation
- Constrained heterogeneous facility location games with max-variant cost
- Constrained heterogeneous two-facility location games with max-variant cost
- Cooperative games in facility location situations with regional fixed costs
- On the Core of Cost Allocation Games Defined on Location Problems
Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Other game-theoretic models (91A40) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Title not available (Why is that?)
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- The \(k\)-level facility location game
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- The facility location problem with general cost functions
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Title not available (Why is that?)
- The Online Median Problem
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Title not available (Why is that?)
- A general global optimization approach for solving location problems in the plane
- Limitations of cross-monotonic cost-sharing schemes
- Greedy approximations for minimum submodular cover with submodular cost
- On minimum submodular cover with submodular cost
- Title not available (Why is that?)
Cited In (10)
- The warehouse-retailer network design game
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
- Limitations of cross-monotonic cost-sharing schemes
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- Cross-monotonic cost sharing methods for connected facility location games
- Constrained heterogeneous facility location games with max-variant cost
- Limitations of cross-monotonic cost sharing schemes
- The \(k\)-level facility location game
This page was built for publication: A cross-monotonic cost-sharing scheme for the concave facility location game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393059)
