TY - JOUR
T1 - Automatic High-Frequency Trading
T2 - An Application to Emerging Chilean Stock Market
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - San Martín, Marco Alarcón
AU - De La Fuente-Mella, Hanns
AU - Castro, Carlos
AU - Paredes, Fernando
N1 - Publisher Copyright:
© 2018 Broderick Crawford et al.
PY - 2018
Y1 - 2018
N2 - This research seeks to design, implement, and test a fully automatic high-frequency trading system that operates on the Chilean stock market, so that it is able to generate positive net returns over time. A system that implements high-frequency trading (HFT) is presented through advanced computer tools as an NP-Complete type problem in which it is necessary to optimize the profitability of stock purchase and sale operations. The research performs individual tests of the algorithms implemented, reviewing the theoretical net return (profitability) that can be applied on the last day, month, and semester of real market data. Finally, the research determines which of the variants of the implemented system performs best, using the net returns as a basis for comparison. The use of particle swarm optimization as an optimization algorithm is shown to be an effective solution since it is able to optimize a set of disparate variables but is bounded to a specific domain, resulting in substantial improvement in the final solution.
AB - This research seeks to design, implement, and test a fully automatic high-frequency trading system that operates on the Chilean stock market, so that it is able to generate positive net returns over time. A system that implements high-frequency trading (HFT) is presented through advanced computer tools as an NP-Complete type problem in which it is necessary to optimize the profitability of stock purchase and sale operations. The research performs individual tests of the algorithms implemented, reviewing the theoretical net return (profitability) that can be applied on the last day, month, and semester of real market data. Finally, the research determines which of the variants of the implemented system performs best, using the net returns as a basis for comparison. The use of particle swarm optimization as an optimization algorithm is shown to be an effective solution since it is able to optimize a set of disparate variables but is bounded to a specific domain, resulting in substantial improvement in the final solution.
UR - http://www.scopus.com/inward/record.url?scp=85055412799&partnerID=8YFLogxK
U2 - 10.1155/2018/8721246
DO - 10.1155/2018/8721246
M3 - Article
AN - SCOPUS:85055412799
SN - 1058-9244
VL - 2018
JO - Scientific Programming
JF - Scientific Programming
M1 - 8721246
ER -