Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Threshold Based Online Algorithms for Portfolio Selection Problem

Antonyan, R. (2016). Threshold Based Online Algorithms for Portfolio Selection Problem. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Basisdaten

einblenden: ausblenden:
Genre: Hochschulschrift

Dateien

einblenden: Dateien
ausblenden: Dateien
:
2016 Master Antonyan.pdf (beliebiger Volltext), 10MB
 
Datei-Permalink:
-
Name:
2016 Master Antonyan.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Eingeschränkt (Max Planck Institute for Informatics, MSIN; )
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Antonyan, Rafaella1, Autor           
Schmidt, Günther2, Ratgeber
Zayer, Rhaleb3, Gutachter           
Affiliations:
1International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
2External Organizations, ou_persistent22              
3Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: This Master Thesis introduces portfolio selection trading strategy named ”Threshold Based Online Algorithm”. A decision into which assets to invest is based on the thresh- old calculated from previous trading periods. In this work have been proposed two different ways for calculating the threshold. The main idea of the algorithm is to exploit the mean reversion property of stock markets by identifying assets that are expected to increase(decrease) in the following trading periods. We run numerical experiments on real datasets to estimate the algorithm performance efficiency. By analysing the empirical performance results, we figured out that TBOA trade-off between wealth per- formance, volatility and downside risks. It performed better on portfolio that contains highly volatile assets with low correlation between them. Evaluation results have shown, that TBOA was able to outperform already existing algorithms on some real datasets. Moreover TBOA has linear time complexity that makes algorithm runs fast.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2016-11-302016
 Publikationsstatus: Online veröffentlicht
 Seiten: 68 p.
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: Antonyanmaster2016
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: