Abstract
Given a graph G = (V,E), we say that a vertex subset S ⊆ V covers a vertex v ∈ V if the edge-connectivity between S and v is at least a given integer k, and also say that S covers an edge vw ∈ E if v and w are covered. We propose the multi-commodity source location problem, which is such that given a vertex- and edge-weighted graph G, r players each select p vertices, and obtain a profit that is the total weight of covered vertices and edges. However, vertices selected by one player cannot be selected by the other players. The goal is to maximize the total profits of all players. We show that the price of greed, which indicates the ratio of the total profit of cooperating players to that of selfish players, is tightly bounded by min { r,p}. Also when k = 2, we obtain tight bounds for vertex-unweighted trees.
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
Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295–304 (2004)
Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. J. of Algorithms 42, 54–68 (2002)
Bárász, M., Becker, J., Frank, A.: An algorithm for source location in directed graphs. EGRES Technical Report, 2004-06 (2004)
Farley, A.M., Fragopoulou, P., Krumme, D., Proskurowski, A., Richards, D.: Multi-source spanning tree problems. J. Interconnection Networks 1, 61–71 (2000)
Hayrapetyan, A., Tardos, É., Wexler, T.: The effect of collusion in congestion games. In: Proc. of the 38th annual ACM symposium on Theory of computing, pp. 89–98 (2006)
Heuvel, J.V.D., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs, CDAM Research Report, LSE-CDAM-2004-10 (2004)
Ito, H., Ito, M., Itatsu, Y., Nakai, K., Uehara, H., Yokoyama, M.: Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40(2), 63–70 (2002)
Ito, H., Uehara, H., Yokoyama, M.: A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans. Fundamentals E83-A, 704–712 (2000)
Lee, W.C.: Spanning tree method for link state aggregation in large communication networks. In: Proc. of the 14th Annual Joint Conference of the IEEE Computer and Communication Societies, vol. 1, pp. 297–302 (1995)
Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Information Processing Letters 80, 287–294 (2001)
Roughgarden, T.: Selfish routing and the price of anarchy. MIT Press, Cambridge (2005)
Sugihara, K., Ito, H.: Maximum-cover source-location problems. IEICE Trans. Fundamentals E89-A, 1370–1377 (2006)
Sugihara, K., Ito, H.: Maximum-cover source-location problem with objective edge-connectivity three. In: Proc. of CTW 2006, University of Duisburg-Essen, Germany, pp. 131–136 (2006), Electronic Notes in Discrete Mathematics 25, 165–171 (2006)
Sugihara, K., Ito, H.: Maximum-cover source-location problem with objective edge-connectivity three (journal version submitted)
Tamura, H., Sengoku, M., Shinoda, S., Abe, T.: Location problems on undirected flow networks. IEICE Trans. E73, 1989–1993 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, H., Paterson, M., Sugihara, K. (2008). Multi-commodity Source Location Problems and Price of Greed. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)