Two-person zero-sum network-interdiction game with multiple inspector types
Approved for public release; distribution is unlimited === 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 networ...
Main Author: | |
---|---|
Other Authors: | |
Published: |
Monterey, California. Naval Postgraduate School
2012
|
Online Access: | http://hdl.handle.net/10945/5334 |
id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-5334 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-53342015-08-06T16:02:16Z Two-person zero-sum network-interdiction game with multiple inspector types Unsal, Omur Wood, R. Kevin Salmeron, Javier Naval Postgraduate School (U.S.) Operations Research Approved for public release; distribution is unlimited 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. 2012-03-14T17:45:05Z 2012-03-14T17:45:05Z 2010-06 Thesis http://hdl.handle.net/10945/5334 648156577 This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, it may not be copyrighted. Monterey, California. Naval Postgraduate School |
collection |
NDLTD |
sources |
NDLTD |
description |
Approved for public release; distribution is unlimited === 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. |
author2 |
Wood, R. Kevin |
author_facet |
Wood, R. Kevin Unsal, Omur |
author |
Unsal, Omur |
spellingShingle |
Unsal, Omur Two-person zero-sum network-interdiction game with multiple inspector types |
author_sort |
Unsal, Omur |
title |
Two-person zero-sum network-interdiction game with multiple inspector types |
title_short |
Two-person zero-sum network-interdiction game with multiple inspector types |
title_full |
Two-person zero-sum network-interdiction game with multiple inspector types |
title_fullStr |
Two-person zero-sum network-interdiction game with multiple inspector types |
title_full_unstemmed |
Two-person zero-sum network-interdiction game with multiple inspector types |
title_sort |
two-person zero-sum network-interdiction game with multiple inspector types |
publisher |
Monterey, California. Naval Postgraduate School |
publishDate |
2012 |
url |
http://hdl.handle.net/10945/5334 |
work_keys_str_mv |
AT unsalomur twopersonzerosumnetworkinterdictiongamewithmultipleinspectortypes |
_version_ |
1716816062256775168 |