English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  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

Files

show Files
hide Files
:
2016 Master Antonyan.pdf (Any fulltext), 10MB
 
File Permalink:
-
Name:
2016 Master Antonyan.pdf
Description:
-
OA-Status:
Visibility:
Restricted (Max Planck Institute for Informatics, MSIN; )
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Antonyan, Rafaella1, Author           
Schmidt, Günther2, Advisor
Zayer, Rhaleb3, Referee           
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              

Content

show
hide
Free keywords: -
 Abstract: 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

show
hide
Language(s): eng - English
 Dates: 2016-11-302016
 Publication Status: Published online
 Pages: 68 p.
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Antonyanmaster2016
 Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show