Operations Research · 1969 · 59 citations · 5 references
BusinessDecision SciencesEconomicsDecision TheoryMarkov Decision ProcessesProbability TheoryExploration-exploitation TradeoffHeuristic SearchOptimal StoppingOptimality TheoryReinforcement LearningReinforcement Learning FoundationsDiscounted Reward MaximizationFinite-horizon Optimal StoppingMinimax SearchPrior Model ProbabilitiesReward-cost Tradeoff
We are told that an object is hidden in one of m(m < ∞) boxes and we are given prior probabilities p i 0 that the object is in the ith box. A search of box i costs c i and finds the object with probability α, if the object is in the box. Also, we suppose that a reward R i is earned if the object is found in the ith box. A strategy is any rule for determining when to search, and, if so, which box. The major result is that an optimal strategy either searches a box with maximal value of α i p i /c i or else it never searches such boxes. Also, if rewards are equal, then an optimal strategy either searches a box with maximal α i p i /c i or else it stops.
5
Ralph E. Strauch · The Annals of Mathematical Statistics · 1966 · 406 citations · Full text
Milton C. Chew · The Annals of Mathematical Statistics · 1967 · 69 citations · Full text
David Matula · American Mathematical Monthly · 1964 · 59 citations
William L. Black · Information and Control · 1965 · 57 citations