{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T02:37:35Z","timestamp":1790908655910,"version":"4.1.0"},"reference-count":19,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the conversion problem, wealth has to be distributed between two assets with the objective to maximize the wealth at the end of the investment horizon. The bi-directional preemptive conversion problem with a constant price interval is the only problem, of the four main variants of the conversion problem, that has not yet been optimally solved by competitive analysis. Assuming a given number of monotonous price trends called runs, lower and upper bounds for the competitive ratio are given. In this work, the assumption of a given number of runs is rejected and lower and upper bounds for the bi-directional preemptive conversion problem with a constant price interval are given. Furthermore, an algorithm based on error balancing is given which at minimum achieves the given upper bound. It can also be shown that this algorithm is optimal for the single-period model.<\/jats:p>","DOI":"10.3390\/a13020042","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T10:10:25Z","timestamp":1582020625000},"page":"42","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lower and Upper Bounds for the Discrete Bi-Directional Preemptive Conversion Problem with a Constant Price Interval"],"prefix":"10.3390","volume":"13","author":[{"given":"Michael","family":"Schwarz","sequence":"first","affiliation":[{"name":"Department of Operations Research and Business Informatics, Saarland University, 66123 Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,2,18]]},"reference":[{"key":"ref_1","unstructured":"Borodin, A., and El-Yaniv, R. (1998). Online Computation and Competitive Analysis, Cambridge University Press."},{"key":"ref_2","first-page":"87","article-title":"Online algorithms for conversion problems. A survey","volume":"19","author":"Mohr","year":"2014","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"El-Yaniv, R., Fiat, A., Karp, R.M., and Turpin, G. (1992, January 24\u201327). Competitive analysis of financial games. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, USA.","DOI":"10.1109\/SFCS.1992.267758"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0020-0190(98)00032-5","article-title":"An improvement on El-Yaniv-Fiat-Karp-Turpin\u2019s money-making bi-directional trading strategy","volume":"66","author":"Dannoura","year":"1998","journal-title":"Inf. Process. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1007\/s10878-017-0131-3","article-title":"Competitive analysis of bi-directional non-preemptive conversion","volume":"34","author":"Schmidt","year":"2017","journal-title":"J. Comb. Optim."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized Efficiency of List Update and Paging Rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Commun. ACM"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/S0097539796299540","article-title":"Beyond Competitive Analysis","volume":"30","author":"Koutsoupias","year":"2000","journal-title":"SIAM J. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/274440.274442","article-title":"Competitive solutions for online financial problems","volume":"30","year":"1998","journal-title":"ACM Comput. Surv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","article-title":"Optimal Search and One-Way Trading Online Algorithms","volume":"30","author":"Fiat","year":"2001","journal-title":"Algorithmica"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10878-010-9344-4","article-title":"Optimal algorithms for online time series search and one-way trading with interrelated prices","volume":"23","author":"Zhang","year":"2012","journal-title":"J. Comb. Optim."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Schroeder, P., and Kacem, I. (2019, January 23\u201326). New algorithms for online time series search with interrelated prices. Proceedings of the 2019 6th International Conference on Control, Decision and Information Technologies, Paris, France.","DOI":"10.1109\/CoDIT.2019.8820654"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1051\/ro\/2018064","article-title":"Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices","volume":"53","author":"Schroeder","year":"2019","journal-title":"RAIRO Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00453-007-9156-9","article-title":"Online Search with Time-Varying Price Bounds","volume":"55","author":"Damaschke","year":"2009","journal-title":"Algorithmica"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00453-008-9217-8","article-title":"Optimal Algorithms for k-Search with Application in Option Pricing","volume":"55","author":"Lorenz","year":"2009","journal-title":"Algorithmica"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.ipl.2011.04.008","article-title":"Online algorithms for the general k-search problem","volume":"111","author":"Zhang","year":"2011","journal-title":"Inf. Process. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"4238","DOI":"10.1007\/s00453-018-00534-9","article-title":"Optimal Online Two-Way Trading with Bounded Number of Transactions","volume":"81","author":"Fung","year":"2019","journal-title":"Algorithmica"},{"key":"ref_17","first-page":"169","article-title":"Two-Way Currency Trading Algorithms in the Discrete Setting","volume":"Volume 9849","author":"Li","year":"2016","journal-title":"Algorithmic Aspects in Information and Management"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Dochow, R. (2016). Online Algorithms for the Portfolio Selection Problem, Springer Gabler.","DOI":"10.1007\/978-3-658-13528-7"},{"key":"ref_19","unstructured":"Schwarz, M. (2019). Kompetitive Algorithmen f\u00fcr den B\u00f6rsenhandel. [Ph.D. Thesis, Saarland University]."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/2\/42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:58:47Z","timestamp":1760173127000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/2\/42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,18]]},"references-count":19,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,2]]}},"alternative-id":["a13020042"],"URL":"https:\/\/doi.org\/10.3390\/a13020042","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,18]]}}}