Optimal search for one of many objects hidden in two boxes
From MaRDI portal
Publication:1098771
DOI10.1016/S0377-2217(87)80147-9zbMath0636.90052OpenAlexW2081326574MaRDI QIDQ1098771
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(87)80147-9
Related Items (4)
Continuous and discrete search for one of many objects ⋮ The search and rescue game on a cycle ⋮ Searching for multiple objects in multiple locations ⋮ Weighted network search games with multiple hidden objects and multiple search teams
Cites Work
- Unnamed Item
- On the functional equation of dynamic programming
- Optimal sequential search: A Bayesian approach
- Discrete sequential search for one of many objects
- Theory of optimal search
- Discrete search and the Neyman-Pearson lemma
- 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
- Technical Note—A Counterexample for an Optimal Search-and-Stop Model
- A Sequential Search Procedure
- A Problem in Optimal Search and Stop
This page was built for publication: Optimal search for one of many objects hidden in two boxes
