On polychotomous search problems

DOI10.1016/0377-2217(94)90265-8zbMath0821.90071OpenAlexW1989984546MaRDI QIDQ1330533

Karl Hinderer, Michael Stieglitz

Publication date: 27 September 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90265-8

zbMATH Keywords

information theoryerror-free informationstochastic sequential search

Mathematics Subject Classification ID

Search theory (90B40) Dynamic programming (90C39)

Related Items

An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Binary search with delayed and missing answers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capital accumulation and the optimization of renewable resource models
• Increasing Lipschitz continuous maximizers of some dynamic programs
• A Dichotomous Search for a Geometric Random Variable
• Optimale nullstellensuche bei vorliegen einer apriori-verteilung
• Another Proof that Convex Functions are Locally Lipschitz
• A Linear Search Problem
• Letter to the Editor—A Search Problem
• A Method for the Construction of Minimum-Redundancy Codes
• Some Theorems on Sorting
• Analytic Inequalities
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimal Search for Detecting a Hidden Object
• On dichotomous search with direction-dependent costs for a uniformly hidden object