Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/95296 
Erscheinungsjahr: 
2010
Schriftenreihe/Nr.: 
Quaderni di Dipartimento No. 113
Verlag: 
Università degli Studi di Pavia, Dipartimento di Economia Politica e Metodi Quantitativi (EPMQ), Pavia
Zusammenfassung: 
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.
Schlagwörter: 
normalized random measure
random discrete distribution
stable subordinator
problem of heaps
Dokumentart: 
Working Paper

Datei(en):
Datei
Größe
169.85 kB





Publikationen in EconStor sind urheberrechtlich geschützt.