Optimal solutions for online conversion problems with interrelated prices (original) (raw)

Abstract

We consider various online conversion problems with interrelated prices. The first variant is the online time series search problem with unknown bounds on the relative price change factors. We design the optimal online algorithm IPN to solve this problem. We then consider the time series search with known bounds. Using the already established UND algorithm of Zhang et al. (J Comb Optim 23(2):159–166, 2012), we develop a new optimal online algorithm oUND which improves the experimental performance of the already existing optimal online algorithm for selected parameter constellations. We conduct a comparative experimental testing of UND and oUND and establish the parameter combinations for which one algorithm is better than the other. We then combine these two algorithms into a new one called cUND. This algorithm incorporates the strengths of UND and oUND and is also optimal online. Finally, we consider another variant, the general _k_-max search problem with interrelated prices, and also develop an optimal online algorithm.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

• Chen G, Kao M, Lyuu Y, Wong H (2001) Optimalbuy-and-hold strategies for financial markets with bounded dailyreturns. SIAM J Comput 31(2):447–459
  Article Google Scholar
• Chin FY, Fu B, Guo J, Han S, Hu J, Jiang M, Lin G, Ting H-F, Zhang L, Zhang Y, Zhou D (2015) Competitive algorithms for unbounded one-way trading. Theor Comput Sci 607:35–48. (Algorithmic Aspects in Information and Management)
  Article Google Scholar
• Clemente J, Hromkovič J, Komm D, Kudahl C (2016) Advice complexity of the online search problem. In: Mäkinen V, Puglisi SJ, Salmela L (eds) Combinatorial algorithms. Springer, Cham, pp 203–212
  Chapter Google Scholar
• Damaschke P, Ha PH, Tsigas P (2009) Online search with time-varying price bounds. Algorithmica 55(4):619–642
  Article Google Scholar
• El-Yaniv R, Fiat A, Karp RM, Turpin G (2001) Optimal search and one-way trading online algorithms. Algorithmica 30(1):101–139
  Article Google Scholar
• Fung SPY (2017) Optimal online two-way trading with bounded number of transactions. In: Computing and combinatorics—23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017, proceedings, pp 212–223
• Lorenz J, Panagiotou K, Steger A (2009) Optimal algorithms for k-search with application in option pricing. Algorithmica 55(2):311–328
  Article Google Scholar
• Mohr E, Ahmad I, Schmidt G (2014) Online algorithms for conversion problems: a survey. Surv Oper Res Manag Sci 19(2):87–104
  Google Scholar
• Savage LJ (1951) The theory of statistical decision. J Am Stat Assoc 28:202–208
  Google Scholar
• Schmidt G (2017) Competitive analysis of bi-directional non-preemptive conversion. J Comb Optim 34(4):1096–1113
  Article Google Scholar
• Schmidt G, Mohr E, Kersch M (2010) Experimental analysis of an online trading algorithm. Electron Notes Discrete Math 36:519–526
  Article Google Scholar
• Schroeder P, Dochow R, Schmidt G (2018) Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function. Comput Ind Eng 119:465–471
  Article Google Scholar
• Schroeder P, Kacem I (2019) Optimal cash management with uncertain, interrelated and bounded demands. Comput Ind Eng 133:195–206
  Article Google Scholar
• Schroeder P, Kacem I, Schmidt G (2019) Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. RAIRO Oper Res 53:559–576
  Article Google Scholar
• Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202–208
  Article Google Scholar
• Wang W, Wang L, Lan Y, Zhang JX (2016) Competitive difference analysis of the one-way trading problem with limited information. Eur J Oper Res 252(3):879–887
  Article Google Scholar
• Zhang W, Xu Y, Zheng F, Dong Y (2012) Optimal algorithms for online time series search and one-way trading with interrelated prices. J Comb Optim 23(2):159–166
  Article Google Scholar
• Zhang W, Xu Y, Zheng F, Liu M (2011) Online algorithms for the general k-search problem. Inf Process Lett 111(14):678–682
  Article Google Scholar

Download references

Acknowledgements

This work has been supported by FP7-EYE. The short version of this work has been partially presented at the 6th international conference on Control, Decision and Information Technologies (CoDIT19), Paris, France, 2019.

Author information

Authors and Affiliations

1. LCOMS EA7306, Université de Lorraine, Metz, France
   Pascal Schroeder & Imed Kacem

Authors

1. Pascal Schroeder
2. Imed Kacem

Corresponding author

Correspondence toPascal Schroeder.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

About this article

Cite this article

Schroeder, P., Kacem, I. Optimal solutions for online conversion problems with interrelated prices.Oper Res Int J 22, 423–448 (2022). https://doi.org/10.1007/s12351-020-00548-8

Download citation

• Received: 07 May 2019
• Revised: 04 January 2020
• Accepted: 16 January 2020
• Published: 31 January 2020
• Version of record: 31 January 2020
• Issue date: March 2022
• DOI: https://doi.org/10.1007/s12351-020-00548-8

Keywords