Limiting behavior of the search cost distribution for the move-to-front rule in the stable case

Fabrizio Leisen, Antonio Lijoi and Christian Paroissin

DES - Working Papers. Statistics and Econometrics. WS from Universidad Carlos III de Madrid. Departamento de Estadística

Abstract: Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. 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 of Barrera and Paroissin and Lijoi and Pruenster that both extend results proved by Kingman 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.

Keywords: Normalized; random; measure; Random; discrete; distribution; Stable; subordinator; Problem; of; heaps (search for similar items in EconPapers)
Date: 2011-07
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://e-archivo.uc3m.es/rest/api/core/bitstreams ... 78d0c27a22a1/content (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cte:wsrepe:ws112922

Access Statistics for this paper

More papers in DES - Working Papers. Statistics and Econometrics. WS from Universidad Carlos III de Madrid. Departamento de Estadística
Bibliographic data for series maintained by Ana Poveda ().