On Genes, Insects, and Crystals: Determining Marginal Diversification Effects With Nature Based Algorithms
A popular argument states that most of the diversification in a portfolio can be obtained with a rather small number of securities. In this paper we present three algorithms to approach the underlying NP-hard problem of portfolio optimization with a cardinality constraint. All three of these algorithms are based on evolutionary processes found in nature: Genetic Algorithms, Ant Systems, and Simulated Annealing. We find that either of the algorithms is well suited to solve the problem. In addition, we show for the stocks in the FT-SE 100 that a small number of well selected stocks might well cause a better diversification than a large number of more or less arbitrarily picked stocks despite their respective weights in the portfolio being optimized.
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Apr 2001|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:152. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.