Abstract
We consider a single source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a simple method for single source rent-or-buy problem that also yields the best-known approximation ratio for the problem. We show how to use a variant of this method to develop an approximately budget-balanced and group strategyproof cost-sharing method for the problem.
The novelty of our approach stems from our obtaining the cost-sharing methods for the rent-or-buy problem by carefully combining cost-shares for the simpler problem Steiner tree problem; we feel that this idea may have wider implications. Our algorithm is conceptually simpler than the previous such cost-sharing method due to Pál and Tardos (Proc. 44th Annual FOCS, pages 584–593, 2003), and has a much improved approximation factor of 4.6 (over the previously known factor of 15).
Research done in part during the IMA workshop on Network Management and Design at the University of Minnesota, April 2003. The research of the second author was supported in part by the National Science Foundation under Grant No. 0208005, and that of the third author in part by ONR grant N00014-98-1-0589, and NSF grants CCR-0311333 and CCR-0325453.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: Proc. 35th FOCS, pp. 276–287 (1994)
Even, G., Goldreich, O., Luby, M., Nisan, N., Veličković, B.: Approximations of general independent distributions. In: Proc. 24th STOC, pp. 10–16 (1992)
Gupta, A., Kumar, A., Kleinberg, J., Rastogi, R., Yener, B.: Provisioning a Virtual Private Network: A network design problem for multicommodity flow. In: Proc. 33rd STOC, pp. 389–398 (2001)
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: 35th STOC, pp. 365–372 (2003)
Kent, K.J., Skorin-Kapov, D.: Population monotonic cost allocations on MSTs. In: Proceedings of the 6th International Conference on Operational Research, Rovinj, 1996 pp. 43–48 (1996)
Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theor. 18, 511–533 (2001)
Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proc. 33rd STOC, pp. 364–372 (2001)
Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proc. 41th FOCS, pp. 613–623 (2000)
Pál, M., Tardos, É.: Group Strategyproof Mechanisms via Primal-Dual Algorithms. In: Proc. 44th FOCS, pp. 584–593 (2003)
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 11th SODA, pp. 770–779 (2000)
Schmidt, J.P., Siegel, A., Srinivasan, A.: Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math. 8, 223–250 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Srinivasan, A., Tardos, É. (2004). Cost-Sharing Mechanisms for Network Design. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive