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

Herbert Moskowitz
Additional contact information
Herbert Moskowitz: Purdue University, West Lafayette, Indiana

Operations Research, 1975, vol. 23, issue 5, 1037-1042

Abstract: 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.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.5.1037 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:5:p:1037-1042

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().