Universal switching portfolios under transaction costs

Suleyman S. Kozat, Andrew Carl Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework under transaction costs. We construct a sequential algorithm for portfolio selection that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors where we pay a fixed percent commission for each transaction. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages5404-5407
Number of pages4
DOIs
StatePublished - Sep 16 2008
Event2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States
Duration: Mar 31 2008Apr 4 2008

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
CountryUnited States
CityLas Vegas, NV
Period3/31/084/4/08

Fingerprint

costs
Costs
diagrams

Keywords

  • Adaptive signal processing
  • Bayesian learning
  • Portfolio selection

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Kozat, S. S., & Singer, A. C. (2008). Universal switching portfolios under transaction costs. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP (pp. 5404-5407). [4518882] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2008.4518882

Universal switching portfolios under transaction costs. / Kozat, Suleyman S.; Singer, Andrew Carl.

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 5404-5407 4518882 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kozat, SS & Singer, AC 2008, Universal switching portfolios under transaction costs. in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP., 4518882, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 5404-5407, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, United States, 3/31/08. https://doi.org/10.1109/ICASSP.2008.4518882
Kozat SS, Singer AC. Universal switching portfolios under transaction costs. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 5404-5407. 4518882. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2008.4518882
Kozat, Suleyman S. ; Singer, Andrew Carl. / Universal switching portfolios under transaction costs. 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. pp. 5404-5407 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).
@inproceedings{9b27366d960444dda08809b449c9ae43,
title = "Universal switching portfolios under transaction costs",
abstract = "In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework under transaction costs. We construct a sequential algorithm for portfolio selection that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors where we pay a fixed percent commission for each transaction. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination.",
keywords = "Adaptive signal processing, Bayesian learning, Portfolio selection",
author = "Kozat, {Suleyman S.} and Singer, {Andrew Carl}",
year = "2008",
month = "9",
day = "16",
doi = "10.1109/ICASSP.2008.4518882",
language = "English (US)",
isbn = "1424414849",
series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
pages = "5404--5407",
booktitle = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP",

}

TY - GEN

T1 - Universal switching portfolios under transaction costs

AU - Kozat, Suleyman S.

AU - Singer, Andrew Carl

PY - 2008/9/16

Y1 - 2008/9/16

N2 - In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework under transaction costs. We construct a sequential algorithm for portfolio selection that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors where we pay a fixed percent commission for each transaction. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination.

AB - In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework under transaction costs. We construct a sequential algorithm for portfolio selection that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors where we pay a fixed percent commission for each transaction. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination.

KW - Adaptive signal processing

KW - Bayesian learning

KW - Portfolio selection

UR - http://www.scopus.com/inward/record.url?scp=51449110622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51449110622&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2008.4518882

DO - 10.1109/ICASSP.2008.4518882

M3 - Conference contribution

AN - SCOPUS:51449110622

SN - 1424414849

SN - 9781424414840

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 5404

EP - 5407

BT - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

ER -