Technical Note—A Recursion Algorithm for Finding Pure Admissible Decision Functions in Statistical Decisions

This note develops a recursion algorithm for finding the set of ordinally admissible decision functions in statistical decision problems when such functions have a Cartesian product structure. An example is used to demonstrate the computations. The generality of the algorithm is discussed briefly, and some computational experience is presented.