A cross-monotonic cost-sharing scheme for the concave facility location game

Authors:
Gaidi Li;Yu Li;Jia Shu;Dachuan Xu
Affiliations:
Department of Applied Mathematics, Beijing University of Technology, Beijing, People's Republic of China 100124;Department of Mathematics, School of Science, Beijing Jiaotong University, Beijing, People's Republic of China 100044;Department of Management Science and Engineering, School of Economics and Management, Southeast University, Nanjing, China;Department of Applied Mathematics, Beijing University of Technology, Beijing, People's Republic of China 100124
Venue:
Journal of Global Optimization
Year:
2013

Citing 16
Cited 0

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
The online median problem

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A push-relabel framework for submodular function minimization and applications to parametric optimization

Discrete Applied Mathematics - Submodularity
A General Global Optimization Approach for Solving Location Problems in the Plane

Journal of Global Optimization
Analysis of greedy approximations with nonsubmodular potential functions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost-sharing schemes

ACM Transactions on Algorithms (TALG)
Continuous location problems and Big Triangle Small Triangle: constructing better bounds

Journal of Global Optimization
Greedy approximations for minimum submodular cover with submodular cost

Computational Optimization and Applications
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

SIAM Journal on Computing
On minimum submodular cover with submodular cost

Journal of Global Optimization
A 1.488 approximation algorithm for the uncapacitated facility location problem

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

Algorithmica
The k-level facility location game

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a cost-sharing scheme for the concave facility location game by exploring the concavity structure. We show that it is cross-monotonic and competitive, and recovers 1/3 fraction of the total cost.