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.
Similar content being viewed by others
References
Blanquero R., Carrizosa E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45, 389–402 (2009)
Byrka J., Aardal K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39, 2212–2231 (2010)
Drezner Z.: A general global optimization approach for solving location problems in the plane. J. Glob. Optim. 37, 305–319 (2007)
Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica. doi:10.1007/s00453-011-9526-1
Du, H., Wu, W., Lee, W., Liu, Q., Zhang, Z., Du, D.: On minimum submodular cover with submodular cost. J. Glob. Optim. doi:10.1007/s10898-010-9563-3
Du, D., Graham, R. L., Pardalos, P.M., Wan, P., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of SODA, pp. 167–175 (2008)
Du D., Wan P., Pardalos P.M., Wu W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45, 463–474 (2010)
Fleischer L., Iwata S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131, 311–322 (2003)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: Proceedings of SODA, pp. 649–657 (1998)
Hajiaghayi M., Mahdian M., Mirrokni V.: The facility location problem with general cost functions. Networks 42, 42–47 (2003)
Immorlica N., Mahdian M., Mirronki V.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4, 1–25 (2008)
Jain K., Vazirani V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274–296 (2001)
Li, S.: A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, Part II, pp. 77–88 (2011)
Mettu, R., Plaxton, C.: The online median problem. In: Proceedings of FOCS, pp. 339–348 (2000)
Moulin H., Shenker S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theory 18, 511–533 (2001)
Pál, M., Tardos, É.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceeding of FOCS, pp. 584–593 (2003)
Pardalos, P.M., Du, D.: Network Design: Connectivity and Facilities Location. DIMACS vol. 40, American Mathematical Society (1998)
Shmoys, D., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceeding of STOC, pp. 265–274 (1997)
Xu D., Du D.: The k-level facility location game. Oper. Res. Lett. 34, 421–426 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper has been presented in ICOTA8.
Rights and permissions
About this article
Cite this article
Li, G., Li, Y., Shu, J. et al. A cross-monotonic cost-sharing scheme for the concave facility location game. J Glob Optim 56, 1325–1334 (2013). https://doi.org/10.1007/s10898-012-9852-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-012-9852-0