Online algorithms for the portfolio selection problem

12Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robert Dochow mathematically derives a simplified classification structure of selected types of the portfolio selection problem. He proposes two new competitive online algorithms with risk management, which he evaluates analytically. The author empirically evaluates online algorithms by a comprehensive statistical analysis. Concrete results are that follow-the-loser algorithms show the most promising performance when the objective is the maximization of return on investment and risk-adjusted performance. In addition, when the objective is the minimization of risk, the two new algorithms with risk management show excellent performance. A prototype of a software tool for automated evaluation of algorithms for portfolio selection is given.

Cite

CITATION STYLE

APA

Dochow, R., & Schmidt, G. (2016). Online algorithms for the portfolio selection problem. Online Algorithms for the Portfolio Selection Problem (pp. 1–185). Springer Fachmedien. https://doi.org/10.1007/978-3-658-13528-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free