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

DOI10.1080/0020739850160107zbMATH Open0558.62010OpenAlexW2091006638WikidataQ124984875 ScholiaQ124984875MaRDI QIDQ3223679FDOQ3223679

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

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

zbMATH Keywords

examplesnew proofNeyman-Pearson theoremoptimizing functionsoptimal receivers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (3)

• Illustrating the Neyman-Pearson lemma with a stopping rule of order \(k\)
• Title not available (Why is that?)
• Solution of the generalized Neyman-Pearson problem using methods of optimal partitioning of sets

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)