Optimal solutions for online conversion problems with interrelated prices

Pascal Schroeder () and Imed Kacem ()
Additional contact information
Pascal Schroeder: Université de Lorraine
Imed Kacem: Université de Lorraine

Operational Research, 2022, vol. 22, issue 1, No 15, 423-448

Abstract: 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.

Keywords: Time series search; Online algorithm; Competitive ratio; Experimental testing; General k-max-search (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12351-020-00548-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:22:y:2022:i:1:d:10.1007_s12351-020-00548-8

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-020-00548-8

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().