Abstract
Financial markets are highly volatile and decision making in these markets is highly risky. With the introduction of automated trading, a number of techniques are developed to facilitate the automation of financial markets. We consider a set of preemptive as well as non-preemptive online algorithms and evaluate them on real world as well as synthetically produced data. We present extensive computational results based on the observed performance of algorithms in terms of experimentally achieved competitive ratio, number of transactions performed and consistency of the results. We also investigate the gap between the worst case competitive ratio and experimentally achieved competitive ratio and conclude that algorithms perform better than their performance guarantee suggest. We conclude by highlighting a number of open questions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Al-Binali, S.: A risk-reward framework for the competitive analysis of financial games. Algorithmica 25, 99–115 (1999)
Brock, W.A., Lakonishok, J., LeBaron, B.: Simple technical trading rules and the stochastic properties of stock returns. Journal of Finance 47, 1731–1764 (1992)
Chang, E.J., Lima, E.J.A., Tabak, B.M.: Testing for predictability in emerging equity markets. Emerging Markets Review 5(3), 295–316 (2004)
Chen, G.-H., Kao, M.-Y., Lyuu, Y.-D., Wong, H.-K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM Journal on Computing 31(2), 447–459 (2001)
Damaschke, P., Ha, P.H., Tsigas, P.: Online search with time-varying price bounds. Algorithmica 55(4), 619–642 (2009)
El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading algorithm. Algorithmica 30, 101–139 (2001)
Hu, S., Guo, Q., Li, H.: Competitive Analysis of On-line Securities Investment. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol. 3521, pp. 224–232. Springer, Heidelberg (2005)
Kwon, K.-Y., Kish, R.J.: A comparative study of technical trading strategies and return predictability: An extension of brock, lakonishok, and lebaron (1992) using NYSE and NASDAQ indices. Quarterly Review of Economics and Finance 42(3), 613–633 (2002)
Lorenz, J., Panagiotou, K., Steger, A.: Optimal algorithms for k-search with application in option pricing. Algorithmica 55(2), 311–328 (2009)
Mohr, E., Schmidt, G.: Empirical Analysis of an Online Algorithm for Multiple Trading Problems. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds.) MCO 2008. CCIS, vol. 14, pp. 299–308. Springer, Heidelberg (2008)
Ratner, M., Leal, R.P.C.: Tests of technical trading strategies in the emerging equity markets of latin america and asia. Journal of Banking and Finance 23, 1887–1905 (1999)
Schmidt, G., Mohr, E., Kersch, M.: Experimental analysis of an online trading algorithm. Electronic Notes in Discrete Mathematics 36, 519–526 (2010)
Shen, P.: Market-timing strategies that worked. Jounal of Portfolio Management 29(2), 57–68 (2003)
Tabak, B.M., Lima, E.J.A.: Market efficiency of brazilian exchange rate: Evidence from variance ratio statistics and technical trading rules. European Journal of Operational Research 194, 814–820 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmad, I., Schmidt, G. (2012). An Experimental Analysis of Online Unidirectional Conversion Problem. In: Huemer, C., Lops, P. (eds) E-Commerce and Web Technologies. EC-Web 2012. Lecture Notes in Business Information Processing, vol 123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32273-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-32273-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32272-3
Online ISBN: 978-3-642-32273-0
eBook Packages: Computer ScienceComputer Science (R0)