Optimal Stopping for Dynamic Recruitment Problem with Probabilistic Loss of Candidates
From MaRDI portal
Publication:5256826
DOI10.1080/07474946.2015.1030974zbMath1320.60103OpenAlexW2612129327MaRDI QIDQ5256826
Wansheng Tang, Ruiqing Zhao, Chi Zhou
Publication date: 29 June 2015
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474946.2015.1030974
Dynamic programming in optimal control and differential games (49L20) Stochastic models in economics (91B70) Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40) Manpower systems in sociology (91D35) Optimal stopping in statistics (62L15)
Related Items (1)
Cites Work
- Optimal age-specific election policies in two-level organizations with fixed size
- Asset-selling problem with an uncertain deadline, quitting offer, and search skipping option
- Optimal stopping problem with double reservation value property
- Optimal stopping problem with finite-period reservation
- Optimal stopping problem with recall cost
- An optimal sequential procedure for a multiple selling problem with independent observations
- Optimal Multiple Stopping with Random Waiting Times
- On the Stochastic Non-sequential Production-planning Problem
- Optimal Expected Rank in a Two-Sided Secretary Problem
- Optimal Statistical Decisions
- A Sharp Ratio Inequality for Optimal Stopping When Only Record Times are Observed
- Optimal Strategies for Selling an Asset
- The Recruitment Trajectory Corresponding to Particular Stock Sequences in Markovian Person-Flow Models
- Optimal Stopping Problem with Controlled Recall
- Optimal Stopping for I.I.D. Random Variables Based on the Sequential Information of the Location of Relative Records Only
- An Optimal Stopping Problem with Two Decision Makers
This page was built for publication: Optimal Stopping for Dynamic Recruitment Problem with Probabilistic Loss of Candidates
