Abstract
Consider the following network subscription pricing problem. We are given a graph G = (V,E) with a root r, and potential customers are companies headquartered at r with locations at a subset of nodes. Every customer requires a network connecting its locations to r. The network provider can build this network with a combination of backbone edges (consisting of high capacity cables) that can route any subset of the customers, and access edges that can route only a single customer’s traffic. The backbone edges cost M times that of the access edges. Our goal is to devise a group-strategyproof pricing mechanism for the network provider, i.e., one in which truth-telling is the optimal strategy for the customers, even in the presence of coalitions. We give a pricing mechanism that is 2-competitive and O(1)-budget-balanced.
As a means to obtaining this pricing mechanism, we present the first primal-dual 8-approximation algorithm for this problem. Since the two-stage Stochastic Steiner tree problem can be reduced to the underlying network design, we get a primal-dual algorithm for the stochastic problem as well. Finally, as a byproduct of our techniques, we also provide bounds on the inefficiency of our mechanism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior 47(1), 36–71 (2004)
Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks (Preliminary version in 23rd STOC, 1991). SIAM J. Comput. 24(3), 440–456 (1995)
Andrews, M., Zhang, L.: Approximation algorithms for access network design (Preliminary version in 39th FOCS, 1998). Algorithmica 34(2), 197–215 (2002)
Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost-sharing. Theoretical Computer Science 304, 215–236 (2003)
Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions (Special issue on internet algorithms). J. Comput. System Sci. 63(1), 21–41 (2001)
Gupta, A., Kumar, A., Kleinberg, J., Rastogi, R., Yener, B.: Provisioning a Virtual Private Network: A network design problem for multicommodity flow. In: STOC. Proceedings of the 33rd ACM Symposium on the Theory of Computing, pp. 389–398. ACM Press, New York (2001)
Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Economics 6, 375–394 (1976)
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC. Proceedings of the 35th ACM Symposium on the Theory of Computing, pp. 365–372. ACM Press, New York (2003)
Gupta, A., Pál, M., Ravi, R., Sinha, A.: Boosted sampling: Approximation algorithms for stochastic optimization problems. In: STOC. Proceedings of the 36th ACM Symposium on the Theory of Computing, pp. 417–426. ACM Press, New York (2004)
Gupta, A., Ravi, R., Sinha, A.: An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS), pp. 218–227 (2004)
Gupta, A., Srinivasan, A., Tardos, É.: Cost-sharing mechanisms for network design. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 139–150. Springer, Heidelberg (2004)
Hayrapetyan, A., Swamy, C., Tardos, É.: Network design for information networks. In: SODA. Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 933–942. ACM Press, New York (2005)
Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: SODA. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 684–693. ACM Press, New York (2004)
Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602–611. ACM Press, New York (2005)
Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC. Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 364–372. ACM Press, New York (2001)
Könemann, J., Leonardi, S., Schäfer, G.: A group-strategyproof mechanism for Steiner forests. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 612–619. ACM Press, New York (2005)
Könemann, J., Leonardi, S., Schäfer, G., van Zwam, S.: From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 930–942. Springer, Heidelberg (2005)
Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41th Symposium on the Foundations of Computer Science (FOCS), pp. 613–623 (2000)
Kent, K.J., Skorin-Kapov, D.: Population monotonic cost allocations on MSTs. In: Proceedings of the 6th International Conference on Operational Research (Rovinj, 1996). Croatian Oper. Res. Soc., Zagreb, pp. 43–48 (1996)
Leonardi, S., Schäfer, G.: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3), 431–442 (2004)
Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare 16, 279–320 (1999)
Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econom. Theory 18(3), 511–533 (2001)
Pál, M., Tardos, É.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS), pp. 584–593 (2003)
Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences, North-Holland, Amsterdam (1979)
Roughgarden, T., Sundararajan, M.: Approximately efficient cost-sharing mechanisms. (Unpublished manuscript)
Ravi, R., Salman, F.S.: Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 29–40. Springer, Heidelberg (1999)
Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: STOC (2006)
Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245–269 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goyal, V., Gupta, A., Leonardi, S., Ravi, R. (2007). Pricing Tree Access Networks with Connected Backbones. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)