
TL;DR
This paper develops an evolutionary game theory framework to analyze how different attack and defense strategies impact network topology, revealing that complex defenses like delegation and clique structures are more effective against sophisticated attacks.
Contribution
It extends static network attack analysis to a dynamic, strategic setting, introducing a game-theoretic model that evaluates various defense mechanisms against different attack strategies.
Findings
Clique-based defenses are highly effective against vertex-order attacks.
Centrality-based attacks outperform vertex-order attacks against clique defenses.
Complex strategies like delegation combined with clique defenses resist centrality attacks better.
Abstract
Often an attacker tries to disconnect a network by destroying nodes or edges, while the defender counters using various resilience mechanisms. Examples include a music industry body attempting to close down a peer-to-peer file-sharing network; medics attempting to halt the spread of an infectious disease by selective vaccination; and a police agency trying to decapitate a terrorist organisation. Albert, Jeong and Barabasi famously analysed the static case, and showed that vertex-order attacks are effective against scale-free networks. We extend this work to the dynamic case by developing a framework based on evolutionary game theory to explore the interaction of attack and defence strategies. We show, first, that naive defences don't work against vertex-order attack; second, that defences based on simple redundancy don't work much better, but that defences based on cliques work well;…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
