Article thumbnail

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

By Fabrizio Leisen, Antonio Lijoi and Christian Paroissin

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.normalized random measure; random discrete distribution; stable subordinator; problem of heaps

OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://economia.unipv.it/docs/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.