Discrete search and the Neyman-Pearson lemma

DOI10.1016/0022-247X(68)90167-4zbMath0155.25402WikidataQ124879271 ScholiaQ124879271MaRDI QIDQ2527110

Joseph B. Kadane

Publication date: 1968

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

statistics

Related Items

A search problem with considering posterior treatments for a detected object, Optimal search for one of many objects hidden in two boxes, Optimal partial hedging in a discrete-time market as a Knapsack problem, Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment, Discrete search and estimation, On optimal search with unknown detection probabilities, Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions, Finding a hider by an unknown deadline, A Stackelberg equilibrium for a missile procurement problem, Some duality relationships for the generalized Neyman-Pearson problem, Quiz show problems, Unnamed Item, On Discrete Search for a Multiple Number of Objects, Optimal discrete search with technological choice, Bayesian analysis of switching regression models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Automatic Method of Solving Discrete Programming Problems
• A Periodic Optimal Search
• On a Searching Problem
• Branch-and-Bound Methods: A Survey
• A Sequential Search Procedure