IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/19888.html
   My bibliography  Save this paper

Bilateral Approach to the Secretary Problem

Author

Listed:
  • David M., Ramsey
  • Krzysztof, Szajowski

Abstract

A mathematical model of competitive selection of the applicants for a post is considered. There are N applicants of similar qualifications on an interview list. The applicants come in a random order and their salary demands are distinct. Two managers, I and II, will interview them one at a time. The aim of the manager is to obtain the applicant which demands minimal salary. The candidate can be accepted only at the moment of its appearance. When both manager want to accept the same candidate, then some rule of assignment to one of the manager is applied. Any candidate hired by the manager will accept the offer with some given probability. An candidate can be hired only at the moment of its appearance. At each moment n one candidate is presented. The considered problem is a generalisation of the best choice problem with uncertain employment and the game version of it with priority or random priority. The general stopping game model is constructed. The algorithms of construction of the game value and the equilibrium strategies are given. An example is solved.

Suggested Citation

  • David M., Ramsey & Krzysztof, Szajowski, 2000. "Bilateral Approach to the Secretary Problem," MPRA Paper 19888, University Library of Munich, Germany, revised 2003.
  • Handle: RePEc:pra:mprapa:19888
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/19888/1/MPRA_paper_19888.pdf
    File Function: original version
    Download Restriction: no

    File URL: https://mpra.ub.uni-muenchen.de/19996/1/MPRA_paper_19996.pdf
    File Function: revised version
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Alpern, Steve & Gal, Shmuel & Solan, Eilon, 2010. "A sequential selection game with vetoes," Games and Economic Behavior, Elsevier, vol. 68(1), pages 1-14, January.
    2. Ramsey, David M. & Szajowski, Krzysztof, 2004. "Correlated equilibria in competitive staff selection problem," MPRA Paper 19870, University Library of Munich, Germany, revised 2006.

    More about this item

    Keywords

    optimal stopping problem; game variant; Markov process; random priority; secretary problem;
    All these keywords.

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    Statistics

    Access and download statistics

    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:pra:mprapa:19888. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.