A new proof of the Neyman‐Pearson lemma from the solution of a maximin receiver problem

DOI10.1080/0020739850160107MaRDI QIDQ3223679zbMATH OpenOpenAlexWikidataFDO

Authors Lawrence Randolph Weill, Ray C. Shiflett

Publication date 1985

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739850160107

zbMATH Keywords

examplesnew proofNeyman-Pearson theoremoptimal receiversoptimizing functions

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Minimax procedures in statistical decision theory (62C20) Statistical decision theory (62C99) Parametric hypothesis testing (62F03)

Recommendations

• The Neyman-Pearson lemma under \(g\)-probability
• scientific article; zbMATH DE number 3685386
• scientific article; zbMATH DE number 3951788
• Generalized Neyman-Pearson lemma via convex duality.
• scientific article; zbMATH DE number 3844815

Cited in

(3)

• Solution of the generalized Neyman-Pearson problem using methods of optimal partitioning of sets
• scientific article; zbMATH DE number 3685386 (Why is no real title available?)
• Illustrating the Neyman-Pearson lemma with a stopping rule of order \(k\)

This page was built for publication: A new proof of the Neyman‐Pearson lemma from the solution of a maximin receiver problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223679)