Abstract
This paper considers a variant of the classical facility location game called the uncapacitated facility location game with penalties (UFLGWP). Unlike the standard UFLG, each client in the UFLGWP is either assigned to an open facility or rejected by paying a penalty. The authors propose a 3-approximate cross-monotonic cost-sharing method for the UFLGWP.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Aardal, F. Chudak, and D. Shmoys, A 3-approximation algorithm for the k-level uncapacitated facility location problem, Information Processing Letters, 1999, 72: 161–167.
A. Ageev, Y. Ye, and J. Zhang, Improved combinatorial approximation algorithms for the k-level location problem, SIAM Journal on Discrete Mathematics, 2004, 18(1): 207–217.
J. Byrka and K. I. Aardal, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, SIAM Journal on Computing, 2010, 39: 2212–2231.
M. Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM Journal on Computing, 2006, 36: 411–432.
D. B. Shmoys, E. Tardös, and K. I. Aardal, Approximation algorithms for facility location problems, Proceedings of STOC, 1997.
D. Xu and S. Zhang, Approximation algorithm for facility location with service installation costs, Operations Research Letters, 2008, 36(1): 46–50.
J. Zhang, Approximating the two-level facility location problem via a quasi-greedy approach, Mathematical Programming, 2006, 108: 159–176.
J. Zhang, B. Chen, and Y. Ye, A multiexchange local search algorithm for the capacitated facility location problem, Mathematics of Operations Research, 2005, 30: 389–403.
M. Charikar, S. Khuller, D. M. Mount and G. Naraasimban, Algorithms for facility location problems with outliers, Proceedings of SODA, 2001.
G. Xu and J. Xu, An LP rounding algorithm for approximating uncapacitated facility location problem with penalities, Information Processing Letters, 2005, 94: 119–123.
G. Xu and J. Xu, An improved approximation algorithm for uncapacitated facility location problems with penalties, Journal of Combinatorial Optimization, 2009, 17: 424–436.
M. Pál and E. Tardös, Group strategyproof mechanisms via primal-dual algorithms, Proceedings of FOCS, 2003.
D. Xu and D. Du, The k-level facility location game, Operations Research Letters, 2006, 34: 421–426.
Y. Li and D. Xu, Soft-capacity facility location game, Acta Mathematicae Applicatae Sinica, English Series, 2010, 26(1): 93–98.
H. Moulin and S. Shenker, Strategyproof sharing of submodular cost: Budget balance versus effciency, Journal of Economic Theory, 2001, 18: 511–533.
R. R. Mettu and C. G. Plaxton, The online median problem, Proceedings of FOCS, 2000.
K. Jain and V. V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median probelms, Jounal of the ACM, 2001, 48: 274–296.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was supported by the National Natural Science Foundation of China under Grant Nos. 60773185 and 11071268, and Program for Beijing Excellent Talents.
This paper was recommended for publication by Editor Shouyang WANG.
Rights and permissions
About this article
Cite this article
Wang, Z., Xu, D. A cost-sharing method for an uncapacitated facility location game with penalties. J Syst Sci Complex 25, 287–292 (2012). https://doi.org/10.1007/s11424-012-9067-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-012-9067-y