Optimal search for one of many objects hidden in two boxes
From MaRDI portal
Recommendations
Cites work
- A Problem in Optimal Search and Stop
- A Remark on Search and Sequencing Problems
- A Sequential Search Procedure
- Binomial Searching for a Random Number of Multinomially Hidden Objects
- Dichotomous Search for Random Objects on an Interval
- Discrete search and the Neyman-Pearson lemma
- Discrete sequential search for one of many objects
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- On the functional equation of dynamic programming
- Optimal sequential search: A Bayesian approach
- Technical Note—A Counterexample for an Optimal Search-and-Stop Model
- Theory of optimal search
Cited in
(25)- Optimal sequential search: A Bayesian approach
- Continuous and discrete search for one of many objects
- Finding a hider by an unknown deadline
- 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?
- Optimal discrete search with technological choice
- The construction of an optimal distribution of search effort
- The discrete search problem and the construction of optimal allocations
- A Dichotomous Search for a Geometric Random Variable
- Optimal Search for an Object with Unknown type
- scientific article; zbMATH DE number 3821428 (Why is no real title available?)
- scientific article; zbMATH DE number 3910122 (Why is no real title available?)
- On Discrete Search for a Multiple Number of Objects
- Search models
- Dynamic search for a moving target
- scientific article; zbMATH DE number 949663 (Why is no real title available?)
- Discrete Search with Directional Information
- scientific article; zbMATH DE number 4121748 (Why is no real title available?)
- Poission search models and the evaluation of stopping rules
- Infinite-horizon scheduling algorithms for optimal search for hidden objects
- Co-ordinating Two Searchers for an Object Hidden on an Interval
- A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
- On dichotomous search with direction-dependent costs for a uniformly hidden object
- The search and rescue game on a cycle
This page was built for publication: Optimal search for one of many objects hidden in two boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098771)