Abstract
We analyze a variant of the whereabouts search problem, in which a searcher looks for a target hiding in one of n possible locations. Unlike in the classic version, our searcher does not pursue the target by actively moving from one location to the next. Instead, the searcher receives a stream of intelligence about the location of the target. At any time, the searcher can engage the location he thinks contains the target or wait for more intelligence. The searcher incurs costs when he engages the wrong location, based on insufficient intelligence, or waits too long in the hopes of gaining better situational awareness, which allows the target to either execute his plot or disappear. We formulate the searcher's decision as an optimal stopping problem and establish conditions for optimally executing this search-and-interdict mission.
| Original language | English |
|---|---|
| Pages (from-to) | 315-328 |
| Journal | Operations Research |
| Volume | 64 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2016 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 16 Peace, Justice and Strong Institutions
Fingerprint
Dive into the research topics of 'When is Information Sufficient for Action? Search with Unreliable Yet Informative Intelligence'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver