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

Fabrizio Leisen, Antonio Lijoi () and Christian Paroissin
Additional contact information
Fabrizio Leisen: Universidad Carlos III de Madrid
Antonio Lijoi: Department of Economics and Quantitative Methods, University of Pavia, and Collegio Carlo Alberto
Christian Paroissin: Universit´e de Pau et des Pays de l’Adour

No 113, Quaderni di Dipartimento from University of Pavia, Department of Economics and Quantitative Methods

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.

Keywords: normalized random measure; random discrete distribution; stable subordinator; problem of heaps (search for similar items in EconPapers)
Pages: 11 pages
Date: 2010-04
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dem-web.unipv.it/web/docs/dipeco/quad/ps/RePEc/pav/wpaper/q113.pdf (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:pav:wpaper:113

Access Statistics for this paper

More papers in Quaderni di Dipartimento from University of Pavia, Department of Economics and Quantitative Methods Contact information at EDIRC.
Bibliographic data for series maintained by Paolo Bonomolo ( this e-mail address is bad, please contact ).