This article presents a simple method for a posteriori (historical) multivariate, multistage optimal trading under transaction costs and a diversification constraint. Starting from a given amount of money in some currency, the authors analyze the stage-wise optimal allocation over a time horizon with potential investments in multiple currencies and various assets. Three variants are discussed: unconstrained trading frequency, a fixed number of total admissible trades, and waiting a specific time period after every executed trade until the next trade. The developed methods are based on efficient graph generation and consequent graph search and are evaluated quantitatively on real-world data. The fundamental motivation of this work is preparatory labeling of financial time-series data for supervised machine learning.
A Posteriori Multistage Optimal Trading under Transaction Costs and a Diversification Constraint
M. Graf Plessen;A. Bemporad
2018-01-01
Abstract
This article presents a simple method for a posteriori (historical) multivariate, multistage optimal trading under transaction costs and a diversification constraint. Starting from a given amount of money in some currency, the authors analyze the stage-wise optimal allocation over a time horizon with potential investments in multiple currencies and various assets. Three variants are discussed: unconstrained trading frequency, a fixed number of total admissible trades, and waiting a specific time period after every executed trade until the next trade. The developed methods are based on efficient graph generation and consequent graph search and are evaluated quantitatively on real-world data. The fundamental motivation of this work is preparatory labeling of financial time-series data for supervised machine learning.File | Dimensione | Formato | |
---|---|---|---|
1709.07527.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
895.1 kB
Formato
Adobe PDF
|
895.1 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.