Hostname: page-component-84b7d79bbc-fnpn6 Total loading time: 0 Render date: 2024-07-26T10:41:41.623Z Has data issue: false hasContentIssue false
  • English
  • Français

An Effective Algorithm for Estimating Stochastic Dominance Efficient Sets

Published online by Cambridge University Press:  06 April 2009

Richard B. Kearns  and
Richard C. Burgess
Get access Rights & Permissions [Opens in a new window]

Extract

An algorithm to estimate the composition of efficient sets by the stochastic dominance (SD) rules was developed and made available to the public by Porter, Wart, and Ferguson (PWF) [1]. Up to that time the computer central processing unit (CPU) time required for the determination of the SD efficient set was prohibitive for a large number of portfolios. The Porter, Wart, and Ferguson algorithm made possible studies that examined the performance of mutual funds, common stocks, and portfolios using the SD rules. Unfortunately, the FORTRAN program developed by PWF and titled D0MIN2 still requires a large amount of CPU time when the number of portfolios exceeds 100.

Type
Research Article
Information
Journal of Financial and Quantitative Analysis , Volume 14 , Issue 3 , September 1979 , pp. 547 - 552
Copyright
Copyright © School of Business Administration, University of Washington 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Porter, R. Burr; Wart, James R.; and Ferguson, Donald L.. “Efficient Algorithms for Conducting Stochastic Dominance Tests on Large Numbers of Portfolios.” Journal of Financial and Quantitative Analysis, Vol. 8 (01 1973), pp. 71–81.CrossRefGoogle Scholar
[2]Hanoch, G., and Levy, H.. “The Efficiency of Choices Involving Risk.” The Review of Economic Studies, Vol. 36 (1969), pp. 335–346.CrossRefGoogle Scholar