Experimental Analysis of an Online Trading Algorithm
暂无分享,去创建一个
Abstract Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to a reservation price algorithm, an average price algorithm and to buy-and-hold. The algorithms are analyzed from a worst case and an empirical case point of view. The effectiveness of the algorithms is analyzed with historical DAX-30 prices for the years 1998 to 2007. The performance of the threat-based algorithm found in the simulation runs dominates all other investigated algorithms. We also compare its performance to results from worst case analysis and conduct a t-test.
[1] Ran El-Yaniv,et al. Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.
[2] B. LeBaron,et al. Simple Technical Trading Rules and the Stochastic Properties of Stock Returns , 1992 .
[3] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .
[4] Esther Mohr,et al. Empirical Analysis of an Online Algorithm for Multiple Trading Problems , 2008, MCO.
[5] Ran El-Yaniv,et al. Competitive solutions for online financial problems , 1998, CSUR.