Finding a hider by an unknown deadline
Loading...
Authors
Lin, Kyle Y.
Singham, Dashi I.
Advisors
Second Readers
Subjects
Search theory
Two-person zero-sum game
Robust strategy
Two-person zero-sum game
Robust strategy
Date of Issue
2016
Date
Publisher
Elsevier
Language
Abstract
An object is hidden among several locations. Each search at the object's location independently finds the object with some location-dependent probability. The goal is to find the object by a deadline, but the deadline is unknown. Assuming the worst case scenario, where Nature knows the deadline and uses this knowledge to hide the object to hinder the search, this paper show that there is a randomized search strategy that simultaneously maximizes the probability of finding the object by any deadline.
Type
Conference Paper
Description
Refereed Conference Paper
The article of record may be found at http://dx.doi.org/10.1016/j.orl.2015.11.003
The article of record may be found at http://dx.doi.org/10.1016/j.orl.2015.11.003
Series/Report No
Department
Operations Research (OR)
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Lin, Kyle Y., and Dashi I. Singham. "Finding a hider by an unknown deadline." Operations Research Letters 44.1 (2016): pp. 25-32.
Distribution Statement
Rights
This 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.