Optimal search for one of many objects hidden in two boxes
โ Scribed by Ariela Sharlin
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 621 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
โฆ Synopsis
A discrete search model for one of many objects hidden in two boxes is studied. The number of objects is assumed to be a random variable with a known prior distribution. When box i is searched, a cost ci > 0 is paid and the conditional probability of finding a specific object given it was hidden there is 0~;. We are interested in determining a search strategy which finds at least one object with minimum expected cost.
Zones of the state space for which Blackwell's rule [3] is optimal are characterized. Based on these results an algorithm for constructing an optimal search sequence is suggested and demonstrated in the case where the number of hidden objects has a geometric distribution.
๐ SIMILAR VOLUMES
This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio
One of the problems that motivated Kant (1787) when he wrote The Critique of Pure Reason was that the epistemological and ontological claims of both rationalism and empiricism presupposed the notion of 'the world as a whole'. This, for him, was not an object of experience, and hence was something ab