Network Inspection for Detecting Strategic Attacks
Mathieu Dahan, Lina Sela, Saurabh Amin

TL;DR
This paper develops a game-theoretic approach to optimize network inspection strategies for detecting multiple strategic attacks efficiently, using minimal detectors while ensuring high detection rates.
Contribution
It formulates a large-scale bilevel optimization problem for network inspection, linking it to zero-sum game equilibria, and proposes a scalable solution using set cover and set packing techniques.
Findings
High detection performance achieved with few detectors
Scalable approach demonstrated on water network benchmarks
Method outperforms existing security game solutions
Abstract
This article studies a problem of strategic network inspection, in which a defender (agency) is tasked with detecting the presence of multiple attacks in the network. An inspection strategy entails monitoring the network components, possibly in a randomized manner, using a given number of detectors. We formulate the network inspection problem as a large-scale bilevel optimization problem, in which the defender seeks to determine an inspection strategy with minimum number of detectors that ensures a target expected detection rate under worst-case attacks. We show that optimal solutions of can be obtained from the equilibria of a large-scale zero-sum game. Our equilibrium analysis involves both game-theoretic and combinatorial arguments, and leads to a computationally tractable approach to solve . Firstly, we construct an approximate solution…
Click any figure to enlarge with its caption.
Figure 1
Figure 1Peer 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.
