Optimal discrete search with technological choice

DOI10.1007/s00186-015-0499-8zbMath1371.90063MaRDI QIDQ2354015

Joseph B. Kadane

Publication date: 10 July 2015

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-015-0499-8

zbMATH Keywords

optimal stopping; greedy algorithm; Neyman-Pearson lemma; myopic strategy; detection search; whereabouts search

Mathematics Subject Classification ID

90B40: Search theory

Related Items

Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete search with multiple sensors
• Optimal discrete search with imperfect specificity
• Search games
• Theory of optimal search
• The theory of search games and rendezvous.
• Discrete search and the Neyman-Pearson lemma
• Multi‐Armed Bandit Allocation Indices
• Hunter, Cauchy rabbit, and optimal Kakeya sets
• Letter to the Editor—Information Theory and Search Theory as Special Cases of Decision Theory
• Optimal Statistical Decisions
• Optimal Search for a Moving Target in Discrete Time and Space
• On Playing Golf with Two Balls
• Dynamical and Game-Theoretical Approaches to an Optimal Patrol Problem
• Search Theory
• The Theory of Search. I. Kinematic Bases
• The Theory of Search. II. Target Detection
• The Theory of Search
• Optimal Whereabouts Search