Two-person zero-sum network-interdiction game with multiple inspector types
Wood, R. Kevin
MetadataShow full item record
Wood (1995) to handle multiple types of interdiction assets (e.g., aircraft, ground-based inspection teams), referred to here as "inspectors." A single evader attempts to traverse a path between two vertices in a directed network while an interdictor, controlling inspectors of different types, attempts to detect the evader by assigning inspectors to edges in the network. Each edge has a known probability of detection if the evader traverses the edge when an inspector of a given type is present. The problem for the interdictor is to find a mixed inspector-to-edge assignment strategy that maximizes the average probability of detecting the evader, i.e., the "interdiction probability." The problem for the evader is to find a mixed "path-selection strategy" that minimizes the interdiction probability. The problem is formulated as a two-person zero-sum game with a surrogate objective that evaluates expected number of detections. That model is solved with a "direct solution procedure" and a "marginal-probability solution procedure." On numerous test problems, both procedures correctly compute expected number of detections, but the latter more often finds a solution that simultaneously optimizes interdiction probability. The latter procedure is also much faster and is therefore preferred.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Lin, Kyle Y.; Singham, Dashi I. (Monterey, California. Naval Postgraduate School, 2015-11); NPS-OR-15-009In a classical search model, an object is hidden in one of many cells. Knowing the probability that the object is in each cell, a searcher wishes to find it. Each search in a cell incurs a cost and will discover the object ...
Loh, Kok-Hua (Monterey, California. Naval Postgraduate School, 1991-09);We present deterministic and probabilistic models for the analysis of strategic strikes against transportation networks. The deterministic models use integer programming to solve problems on single and multicommodity ...
Tsamtsaridis, Charalampos I. (Monterey, California. Naval Postgraduate School, 2011-12);This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and missile ...