Abstract
Given a graph G = (V, E) and a set of vertices MV, a vertex v ā V is said to be controlled by M if the majority of vās neighbors (including itself) belongs to M. M is called a monopoly if every vertex v ā V is controlled by M. For a specified M and a range for E (E1 EE2),we try to determine E such that M is a monopoly in G = (V,E). We first present a polynomial algorithm for testing if such an E exists, by formulating it as a network flow problem. Assuming that a solution E does exist, we then show that a solution with the maximum or minimum |E| can be found in polynomial time, by considering them as weighted matching problems.
In case there is no solution E, we want to maximize the number of vertices controlled by the given M. Unfortunately, this problem turns out to be NP-hard. We therefore design a simple approximation algorithm which guarantees an approximation ratio of 2.
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
J-C. Bermond and D. Peleg, The power of small coalitions in graphs, Proc. SIROCCOā95, Olympia, Greece, Carleton Univ. Press, 173ā184, 1995.
D. Fitoussi and M. Tennenholtz, Minimal social laws, Proc. AAAIā98, 26ā31, 1998.
U. Feige, A threshold of lnn for approximating set cover, Proc. STOCā96, 314ā318, 1996.
H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for general graph matching problems, Journal of the ACM, 38, 815ā853, 1991.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, New York, 1979.
A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, Journal of the ACM, 45, 783ā797, 1998.
Y. Hassin and D. Peleg, Distributed probabilistic polling and applications to proporti onate agreement, Proc. ICALPā99, LNCS 1644, 402ā411, 1999.
N. Linial, D. Peleg, Y. Rabinovich and M. Saks, Sphere packing and local majorities in graphs, Proc. 2nd Israel Symposium on Theoretical Computer Science, IEEE Computer Soc. Press, 141ā149, 1993.
C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc. STOCā93, 286ā293, 1993.
T. Nakata, H. Imahayashi, and M. Yamashita, Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs, Proc. COCOON, LNCS 1627, 330ā338, 1999.
T. Nakata, H. Imahayashi, and M. Yamashita, A Probabilistic Local Majority Polling Game on Weighted Directed Graphs with an Application to the Distributed Agreement Problem, Networks (to appear).
D. Peleg, Local majority voting, small coalitions and controlling monopolies in graphs: A review, Technical Report CS96-12, Weizmann Institute, 1996.
D. Peleg, Size bounds for dynamic monopolies, Discrete Applied Mathematics, 86, 263ā273, 1998.
Y. Shoham and M. Tennenholtz, Emergent conventions in multi-agent systems: initial experimental results and observations, Proc. KRā92, 225ā231, 1992.
Y. Shoham and M. Tennenholtz, On the systhesis of useful social laws for artificial agent societies, Proc. AAAIā92, 276ā281, 1992.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
Ā© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makino, K., Yamashita, M., Kameda, T. (2000). Max- and Min-Neighborhood Monopolies. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_43
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive