Show simple item record

dc.contributor.authorLin, Kyle Y.
dc.contributor.authorSingham, Dashi I.
dc.date.accessioned2017-04-21T19:47:30Z
dc.date.available2017-04-21T19:47:30Z
dc.date.issued2016
dc.identifier.citationLin, Kyle Y., and Dashi I. Singham. "Finding a hider by an unknown deadline." Operations Research Letters 44.1 (2016): pp. 25-32.
dc.identifier.urihttp://hdl.handle.net/10945/52672
dc.descriptionRefereed Conference Paperen_US
dc.descriptionThe article of record may be found at http://dx.doi.org/10.1016/j.orl.2015.11.003en_US
dc.description.abstractAn 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.
dc.publisherElsevier
dc.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.en_US
dc.titleFinding a hider by an unknown deadlineen_US
dc.typeConference Paperen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentOperations Research (OR)
dc.subject.authorSearch theory
dc.subject.authorTwo-person zero-sum game
dc.subject.authorRobust strategy


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record