Volume 53, Number 2, April-June 2019
|Page(s)||559 - 576|
|Published online||05 June 2019|
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices
LCOMS EA 7306, Université de Lorraine, Metz, France
2 Max-Planck Institute for Informatics, Saarbrücken, Germany
* Corresponding author: email@example.com
Accepted: 4 September 2018
In this work we investigate the portfolio selection problem (P1) and bi-directional trading (P2) when prices are interrelated. Zhang et al. (J. Comb. Optim. 23 (2012) 159–166) provided the algorithm UND which solves one variant of P2. We are interested in solutions which are optimal from a worst-case perspective. For P1, we prove the worst-case input sequence and derive the algorithm optimal portfolio for interrelated prices (OPIP). We then prove the competitive ratio and optimality. We use the idea of OPIP to solve P2 and derive the algorithm called optimal conversion for interrelated prices (OCIP). Using OCIP, we also design optimal online algorithms for bi-directional search (P3) called bi-directional UND (BUND) and optimal online search for unknown relative price bounds (RUN). We run numerical experiments and conclude that OPIP and OCIP perform well compared to other algorithms even if prices do not behave adverse.
Mathematics Subject Classification: 90C27
Key words: Competitive analysis / portfolio selection / two-way trading / online algorithms / bi-directional search
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.