IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v39y1991i2p325-343.html
   My bibliography  Save this article

Optimal choice and assignment of the best m of n randomly arriving items

Author

Listed:
  • Wilson, John G.

Abstract

A total of n items arrive at random. The decision maker must either select or discard the current item. Ranks must be assigned to items as they are selected. The decision maker's goal is to follow a procedure that maximises the probability of selecting the m best items and assigning them according to their rank order. For m=1 this is the classical secretary problem. Rose (1982) solved the m=2 case. Key mathematical properties for the general m out of n problem are developed: functional equations expressing the general problem in terms of lower dimensional problems and theorems regarding the structure of optimal strategies are provided. A key optimal stopping result for the general problem is provided. Using these results a procedure for solving the above problem for any given m and n is developed. Using this algorithm, explicit formulas--similar in form to those for the well known m=1 and m=2 cases--can be derived. As an example, explicit formulas for the previously unsolved m=3 finite secretary problem are provided.

Suggested Citation

  • Wilson, John G., 1991. "Optimal choice and assignment of the best m of n randomly arriving items," Stochastic Processes and their Applications, Elsevier, vol. 39(2), pages 325-343, December.
    • Handle: RePEc:eee:spapps:v:39:y:1991:i:2:p:325-343
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(91)90086-R
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aarni Lehtinen, 1997. "Optimal selection of thek best of a sequence withk stops," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 46(2), pages 251-261, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:39:y:1991:i:2:p:325-343. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.