Continuous and discrete search for one of many objects

DOI10.1016/0167-6377(87)90050-2MaRDI QIDQ1101338zbMATH OpenOpenAlexFDO

Authors David Assaf, Shmuel Zamir

Publication date 1987

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(87)90050-2

zbMATH Keywords

discrete searchmost inviting strategyuniformly optimal strategy

Mathematics Subject Classification ID

Search theory (90B40)

Review text

By an easy observation we show that the basic result of \textit{D. Blackwell} [``Notes on dynamic programming, unpublished notes, Univ. California, Berkeley (1962)], according to which the most inviting strategy is optimal in a discrete search for one object, is also true when the number of objects is random provided the search is made in continuous time. This result does not hold in the discrete search model even when only two boxes are present (contrary to a conjecture of \textit{F. H. Smith} and \textit{G. Kimeldorf} [Ann. Stat. 3, 906-915 (1975; Zbl 0312.90033)]). For the case of two boxes, a convenient sufficient condition on the distribution of the number of objects is provided which ensures optimality of the most inviting strategy. As a result, this strategy is shown to be optimal for several important distributions.

Recommendations

• Optimal search for one of many objects hidden in two boxes
• On Discrete Search for a Multiple Number of Objects
• Optimal sequential search: A Bayesian approach
• scientific article; zbMATH DE number 4121748
• The construction of an optimal distribution of search effort

Cites work

• A Remark on Search and Sequencing Problems
• Binomial Searching for a Random Number of Multinomially Hidden Objects
• Dichotomous Search for Random Objects on an Interval
• Discrete sequential search for one of many objects
• On optimal search with unknown detection probabilities
• Optimal search for one of many objects hidden in two boxes
• Optimal sequential search: A Bayesian approach
• Theory of optimal search

Cited in

(15)

• Optimal search for one of many objects hidden in two boxes
• Searching for multiple objects in multiple locations
• Weighted network search games with multiple hidden objects and multiple search teams
• When is it best to follow the leader?
• Variability and the Duration of Search
• On Discrete Search for a Multiple Number of Objects
• An elementary approach to optimal discrete-time search strategies
• Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment
• scientific article; zbMATH DE number 3996931 (Why is no real title available?)
• Discrete Search with Directional Information
• scientific article; zbMATH DE number 4121748 (Why is no real title available?)
• Discrete Search for an Intelligent Object: The Leprechaun's Problem
• The search and rescue game on a cycle
• Discrete search with multiple sensors
• Search for an object with two attributes

This page was built for publication: Continuous and discrete search for one of many objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101338)