Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/95296
Authors: 
Leisen, Fabrizio
Lijoi, Antonio
Paroissin, Christian
Year of Publication: 
2010
Series/Report no.: 
Quaderni di Dipartimento 113
Abstract: 
Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or ppopularities). The induced Markov chain is known to be ergodic [4]. One main problem is the study of the distribution of the search cost defined as the position of the required item. Here we first establish the link between two recent papers [3, 8] that both extend results proved by Kingman [7] on the expected stationary search cost. Combining results contained in these papers, we obtain the limiting behavior for any moments of the stationary seach cost as n tends to infinity.
Subjects: 
normalized random measure
random discrete distribution
stable subordinator
problem of heaps
Document Type: 
Working Paper

Files in This Item:
File
Size
169.85 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.