Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Defending Critical Infrastructure
Interfaces
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Encounter-based worms: Analysis and defense
Ad Hoc Networks
On the Approximability of Influence in Social Networks
SIAM Journal on Discrete Mathematics
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
Improved algorithms and complexity results for power domination in graphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Models and analysis of active worm defense
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Deterministic network interdiction
Mathematical and Computer Modelling: An International Journal
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
Containment of misinformation spread in online social networks
Proceedings of the 3rd Annual ACM Web Science Conference
Interest-matching information propagation in multiple online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
We consider a two-stage defender-attacker game that takes place on a network, in which the attacker seeks to take control over (or "influence") as many nodes as possible. The defender acts first in this game by protecting a subset of nodes that cannot be influenced by the attacker. With full knowledge of the defender's action, the attacker can then influence an initial subset of unprotected nodes. The influence then spreads over a finite number of time stages, where an uninfluenced node becomes influenced at time t if a threshold number of its neighbors are influenced at time t驴1. The attacker's objective is to maximize the weighted number of nodes that are influenced over the time horizon, where the weights depend both on the node and on the time at which that is influenced. This defender-attacker game is especially difficult to optimize, because the attacker's problem itself is NP-hard, which precludes a standard inner-dualization approach that is common in many interdiction studies. We provide three models for solving the attacker's problem, and develop a tailored cutting-plane algorithm for solving the defender's problem. We then demonstrate the computational efficacy of our proposed algorithms on a set of randomly generated instances.