A cross-monotonic cost-sharing scheme for the concave facility location game
From MaRDI portal
Publication:2393059
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
Cites work
- scientific article; zbMATH DE number 5764849 (Why is no real title available?)
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- scientific article; zbMATH DE number 1153375 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A general global optimization approach for solving location problems in the plane
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Greedy approximations for minimum submodular cover with submodular cost
- Limitations of cross-monotonic cost-sharing schemes
- On minimum submodular cover with submodular cost
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The Online Median Problem
- The \(k\)-level facility location game
- The facility location problem with general cost functions
Cited in
(11)- 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
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- Cross-monotonic cost sharing methods for connected facility location games
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- An approximate cost recovery scheme for the \(k\)-product facility location game with penalties
- Limitations of cross-monotonic cost-sharing schemes
- The \(k\)-level facility location game
- Limitations of cross-monotonic cost sharing schemes
- Constrained heterogeneous facility location games with max-variant cost
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)
