The necessity of strongly subadditive capacities for Neyman-Pearson minimax tests (Q1098183): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Kapazitäten und obere Einhüllende von Maßen. (Capacities and upper envelopes of measures.) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinitely subadditive capacities as upper envelopes of measures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary experiments, minimax tests and 2-alternating capacities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimax tests and the Neyman-Pearson lemma for capacities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimax tests and the Neyman-Pearson lemma for capacities. Correction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4052400 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Minimax Theorems. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5644209 / rank | |||
Normal rank |
Revision as of 15:50, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The necessity of strongly subadditive capacities for Neyman-Pearson minimax tests |
scientific article |
Statements
The necessity of strongly subadditive capacities for Neyman-Pearson minimax tests (English)
0 references
1988
0 references
The main result is the following converse of \textit{P. J. Huber} and \textit{V. Strassen}'s Neyman-Pearson lemma for minimax tests [Ann. Stat. 1, 251- 263 (1973; Zbl 0259.62008)]: Let \({\mathcal P}\) be a weakly compact set of Borel probability measures on a Polish space X having the property that, for every Borel probability measure Q on X, there exist some \(P\in {\mathcal P}\) and some version g of dQ/dP such that, for arbitrary \(\alpha\in [0,1]\), the Neyman-Pearson test of level \(\alpha\) between P and Q determined by g is a minimax test of the same level between \({\mathcal P}\) and \(\{\) \(Q\}\). Then the upper envelope \(c\) of \({\mathcal P}\) is a strongly subadditive capacity, and \({\mathcal P}\) is the convex set of all Borel probability measures on X dominated by \(c.\) For X finite, this result is due to Huber and Strassen, whereas a modified version for Polish spaces involving all finite sub-\(\sigma\)- algebras of the Borel \(\sigma\)-algebra was proved by \textit{T. Bednarski} [ibid. 10, 226-232 (1982; Zbl 0496.62004)].
0 references
Neyman-Pearson lemma
0 references
minimax tests
0 references
weakly compact set of Borel probability measures
0 references
strongly subadditive capacity
0 references
Polish spaces
0 references
0 references