Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates
Pascal Schroeder, Günter Schmidt, Günter Schmidt, Imed Kacem · 2016
We consider bi-directional non-preemptive conversion with interrelated conversion rate bounds. We solve this conversion problem with two on-line algorithms BUND and RUN and give their competitive ratio. We further observe optimality of both on-line algorithms. We also use empirical data of the Johannesburg Stock Exchange to get further insights into RUN and BUND.