Elimination of randomization and hunt-stein type theorems in invariant statistical decision problems
DOI10.1080/02331888708801995zbMath0633.62001OpenAlexW2061298412MaRDI QIDQ3771383
Publication date: 1987
Published in: Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331888708801995
equivariantconvexity conditionselimination of randomizationconvexity theorem of Lyapunov typeessential completeness of the nonrandomized equivariant decision rulesHunt-Stein type theoremsinfinite dimensional decision spacesinvariant decision problemslambda-minimax decision rulesrisk- equivalence
Minimax procedures in statistical decision theory (62C20) Foundations and philosophical topics in statistics (62A01) Complete class results in statistical decision theory (62C07)
Cites Work
- Elimination of randomization in statistical decision theory reconsidered
- Statistical decision theory. Foundations, concepts, and methods
- Convex analysis and measurable multifunctions
- Integral representation in the set solutions of a generalized moment problem
- Measures and barycenters of measures on convex sets in lacally convex spaces. I
- Invariance, Minimax Sequential Estimation, and Continuous Time Processes
- Invariance Theory and a Modified Minimax Principle
- A general denseness result for relaxed control theory
- Amenability: A survey for statistical applications of hunt-stein and related conditions on groups
- AN EXTREME POINT CRITERION FOR SEPARABILITY OF A DUAL BANACH SPACE, AND A NEW PROOF OF A THEOREM OF CORSON
- On a Theorem of Lyapunov
- A Special Group Structure and Equivariant Estimation
- Elimination of Randomization in Certain Statistical Decision Procedures and Zero-Sum Two-Person Games
- The use of Previous Experience in Reaching Statistical Decisions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Elimination of randomization and hunt-stein type theorems in invariant statistical decision problems
