Abstract
Suppose that we are given a set of n elements which are to be arranged in some order. At each unit of time a request is made to retrieve one of these elements — the ith being requested with probability Pi. We show that the rule which always moves the requested element one closer to the front of the line minimizes the average position of the element requested among a wide class of rules for all probability vectors of the form P1 = p, P2= · ·· = Pn = (1 – p)/(n − 1). We also consider the above problem when the decision-maker is allowed to utilize such rules as ‘only make a change if the same element has been requested k times in a row', and show that as k approaches infinity we can do as well as if we knew the values of the Pi.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference6 articles.
1. On self-organizing sequential search heuristics
2. On a model for storage and search
3. The stationary distribution of an interesting Markov chain
4. On serial files with relocatable records;Mccabe;Operat. Res.,1965
5. Sur quelques applications des fonctions convexes et concaves au sens de I. Schur;Ostrowski;J. Math. Pures Appl.,1964
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献