Advanced Search
MyIDEAS: Login to save this paper or follow this series

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

Contents:

Author Info

  • Fabrizio Leisen

    ()

  • Antonio Lijoi

    ()

  • Christian Paroissin

    ()

Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://e-archivo.uc3m.es/bitstream/10016/12114/1/ws112922.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Universidad Carlos III, Departamento de Estadística y Econometría in its series Statistics and Econometrics Working Papers with number ws112922.

    as in new window
    Length:
    Date of creation: Jul 2011
    Date of revision:
    Handle: RePEc:cte:wsrepe:ws112922

    Contact details of provider:
    Postal: C/ Madrid, 126 - 28903 GETAFE (MADRID)
    Phone: 6249847
    Fax: 6249849
    Web page: http://www.uc3m.es/uc3m/dpto/DEE/departamento.html
    More information through EDIRC

    Related research

    Keywords: Normalized random measure; Random discrete distribution; Stable subordinator; Problem of heaps;

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws112922. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.