Optimal Sequential Selection Based on Relative Ranks with Renewable Call Options
暂无分享,去创建一个
[1] Edward J. Dudewicz,et al. Optimal Selection From a Finite Sequence With Sampling Cost , 1981 .
[2] W. T. Rasmussen,et al. Choosing the maximum from a sequence with a discount function , 1975 .
[3] Joseph D. Petruccelli. Best-choice problems involving uncertainty of selection and recall of observations , 1981 .
[4] David Lindley,et al. Optimal Statistical Decisions , 1971 .
[5] K. Hinderer,et al. Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter , 1970 .
[6] Thomas J. Lorenzen. Optimal Stopping with Sampling Cost: The Secretary Problem , 1981 .
[7] Ruth M Corbin,et al. The secretary problem as a model of choice , 1980 .
[8] Mark C. K. Yang. Recognizing the maximum of a random sequence based on relative rank with backward solicitation , 1974 .
[9] F. Mosteller,et al. Recognizing the Maximum of a Sequence , 1966 .
[10] S. M. Samuels,et al. The Finite-Memory Secretary Problem , 1977 .