Discrete Search with Directional Information

From MaRDI portal





An unknown number N of cells are arranged in numerical order and an object is hidden in cell N. A searcher would like to maximize the probability of finding the object within n searches. A search in location i gives the information: \(N>i\), \(N=i\), or \(N<i\). However, there is a probability w of a wrong information which indicates \(i>N\) even though \(N>i\) or \(N=i.\) The authors consider several special cases and characterize the optimal search strategies when there are at most two cells and also when \(w=0\). They compare experimentally three intuitively reasonable strategies in the case that the object is hidden with equal probabilities in one of m cells.











This page was built for publication: Discrete Search with Directional Information

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