Guessing fractions of online sequences

An online algorithm is typically unaware of the length of the input request sequence that it is called upon. Consequently, it cannot determine whether it has already processed most of its input or whether the bulk of work is still ahead. In this paper, we are interested in whether some sort of orientation within the request sequence is nevertheless possible. For a real number 0 < f < 1, our objective is to preemptively guess the position fn within the request sequence of unknown length n: While processing the input, the online algorithm maintains a guess and is only allowed to update its guess to the position of the current element under investigation. We give a complete characterization of the optimal guessing strategies with respect to f : For f <= f0 asymptotic to 0.1867, the trivial algorithm that never updates its initial guess is (asymptotically) optimal. For f > f0, we give a randomized algorithm that in expectation places the guess at distance /3(f )n from fn, where /3 is a non-elementary function, and we prove that this is optimal. Our findings show that the position fmaxn asymptotic to 0.2847n is hardest to guess. We also give upper and lower bounds for a natural extension to weighted sequences. Our work can also be seen as the first randomized approach to the online check pointing problem. (c) 2020 Elsevier B.V. All rights reserved. Superscript/Subscript Available更多