A Competitive analysis of the list update problem with lookahead

Abstract

We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list update problem using these models. In addition to lower bounds we present a number of competitive on-line algorithms with lookahead.KeywordsCompetitive AnalysisCompetitive FactorRequest SequenceFuture RequestAmortize CostThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.