Continuous and discrete search for one of many objects

DOI10.1016/0167-6377(87)90050-2zbMath0642.90062OpenAlexW2045360847MaRDI QIDQ1101338

Shmuel Zamir, David Assaf

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

uniformly optimal strategydiscrete searchmost inviting strategy

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (4)

The search and rescue game on a cycle ⋮ Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment ⋮ Searching for multiple objects in multiple locations ⋮ Weighted network search games with multiple hidden objects and multiple search teams

Cites Work

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

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