Abstract
We have previously observed that it is unwise to repeatedly use an inadmissible decision rule. (The possible exception is when an inadmissible rule is very simple and easy to use, and is only slightly inadmissible.) It is, therefore, of interest to find, for a given problem, the class of acceptable (usually admissible) decision rules. Such a class is often much easier to work with, say in finding a sequential Bayes, minimax or a Γ-minimax decision rule, than is the class of all decision rules. In this chapter, we discuss several of the most important situations in which simple reduced classes of decision rules have been obtained. Unfortunately, the subject tends to be quite difficult mathematically, and so we will be able to give only a cursory introduction to some of the more profound results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Science+Business Media New York
About this chapter
Cite this chapter
Berger, J.O. (1985). Complete and Essentially Complete Classes. In: Statistical Decision Theory and Bayesian Analysis. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4286-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4286-2_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3074-3
Online ISBN: 978-1-4757-4286-2
eBook Packages: Springer Book Archive