Publication Cover
Sequential Analysis
Design Methods and Applications
Volume 34, 2015 - Issue 2
187
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Optimal Stopping for Dynamic Recruitment Problem with Probabilistic Loss of Candidates

, &
Pages 187-210 | Received 14 Aug 2014, Accepted 12 Feb 2015, Published online: 18 May 2015

REFERENCES

  • Allaart , P. C. ( 2009 ). A Sharp Ratio Inequality for Optimal Stopping When Only Record Times Are Observed , Sequential Analysis 28 : 455 – 458 .
  • Bellman , R. E. ( 1957 ). Dynamic Programming , Princeton : Princeton University Press .
  • Christensen , S. , Irle , A. , and Jürgens , S. ( 2013 ). Optimal Multiple Stopping with Random Waiting Times , Sequential Analysis 32 : 297 – 318 .
  • DeGroot , M. H. ( 2004 ). Optimal Statistical Decisions , New York : Wiley .
  • DeVaro , J. ( 2005 ). Employer Recruitment Strategies and the Labor Market Outcomes of New Hires , Economic Inquiry 43 : 263 – 282 .
  • DeVaro , J. ( 2008 ). The Labor Market Effects of Employer Recruitment Choice , European Economic Review 52 : 283 – 314 .
  • Ee , M. S. ( 2009 ). Asset-Selling Problem with an Uncertain Deadline, Quitting Offer, and Search Skipping Option , European Journal of Operational Research 198 : 215 – 222 .
  • Eriksson , K. , Sjöstrand , J. , and Strimling , P. ( 2007 ). Optimal Expected Rank in a Two-Sided Secretary Problem , Operations Research 55 : 921 – 931 .
  • Feichtinger , G. , Krasovskii , A. A. , Prskawetz , A. , and Veliov , V. M. ( 2012 ). Optimal Age-Specific Election Policies in Two-Level Organizations with Fixed Size , Central European Journal of Operations Research 20 : 649 – 677 .
  • Feichtinger , G. and Mehlmann , A. ( 1976 ). The Recruitment Trajectory Corresponding to Particular Stock Sequences in Markovian Person-Flow Models , Mathematics of Operations Research 1 : 175 – 184 .
  • Ikuta , S. ( 1995 ). Optimal Stopping Problem with Several Search Areas , Journal of Operations Research Society of Japan 38 : 89 – 106 .
  • Kang , B. K. ( 1999 ). Optimal Stopping Problem with Recall Cost , European Journal of Operational Research 117 : 222 – 238 .
  • Kang , B. K. ( 2005 ). Optimal Stopping Problem with Double Reservation Value Property , European Journal of Operational Research 165 : 765 – 785 .
  • Krichen , S. and Abdelaziz , F. B. ( 2007 ). An Optimal Stopping Problem with Two Decision Makers , Sequential Analysis 26 : 467 – 480 .
  • McCall , J. J. ( 1965 ). The Economics of Information and Optimal Stopping Rules , Journal of Business 38 : 300 – 317 .
  • Preater , J. ( 1998 ). A Dynamic Recruitment Problem , Institute of Mathematics and Its Applications Journal of Management Mathematics 9 : 19 – 34 .
  • Rao , P. P. ( 1990 ). A Dynamic Programming Approach to Determine Optimal Manpower Recruitment Policies , Journal of Operational Research Society 41 : 983 – 988 .
  • Rosenfield , D. B. , Shapiro , R. D. , and Butler , D. A. ( 1983 ). Optimal Strategies for Selling an Asset , Management Science 29 : 1051 – 1061 .
  • Saito , T. ( 1998 ). Optimal Stopping Problem with Controlled Recall , Probability in Engineering and Informational Sciences 12 : 91 – 108 .
  • Saito , T. ( 1999 ). Optimal Stopping Problem with Finite-Period Reservation , European Journal of Operational Research 118 : 605 – 619 .
  • Samuel-Cahn , E. ( 2007 ). Optimal Stopping for IID Random Variables Based on the Sequential Information of the Location of Relative Records Only , Sequential Analysis 26 : 395 – 401 .
  • Sofronov , G. ( 2012 ). An Optimal Sequential Procedure for a Multiple Selling Problem with Independent Observations , European Journal of Operational Research 225 : 332 – 336 .
  • Recommended by Nitis Mukhopadhyay
  • Color versions of one or more of the figures in the article can be found online at http://www.tandfonline.com/lsqa.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.