A Secretay Problem With Refusing
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper,we comsider a class of special secretary problem. Every applicant can refuse an offier of employment with a probability which depend only on her absolute rank. We derive the optimal stopping rule which maximizes the probabitily of employing the best one.

    Reference
    Related
    Cited by
Get Citation

Jin Zhiming. A Secretay Problem With Refusing[J]. Journal of National University of Defense Technology,1986,(2):69-75.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 03,1985
  • Revised:
  • Adopted:
  • Online: August 18,2017
  • Published:
Article QR Code