[1] Chow Y S, Robbins H, Siegmund D. Great Expectation:TheTheory of Optimal Stopping[M]. Boston:Houhgton Mifflin, 1971. [2] Shiryaev A N. Optimal Stopping Rules[M]. New York:Springer,1978. [3] 金治明. 最优停止理论及其应用[M]. 长沙:国防科技大学出版社,1995. [4] Peskir G, Shiryaev A. Optimal Stopping and Free-BoundaryProblems[M]. Berlin:Birkhauser Verlag, 2006. [5] Gardner M. Mathematical Games:The games and puzzles of LewisCarroll, and the answers to February's problems[J]. ScientificAmerican, 1960, 202(3):172-182. [6] Pressman E L, Sonin I M. The best choice problem for a random numberof objects[J]. Theory of Probability and its Applications,1972, 17(4):657-668. [7] Cowan R, Zabczyk J. An optimal selection problem associated with thePoisson process[J]. Theory of Probability and itsApplications, 1978, 23:584-592. [8] Stewart T J. The secretary problem with an unkonw number of options[J]. Operations Research, 1981, 29(2):130-145. [9] Abdel-Hamid A R, Bather J A, Trustrum G B. The secretary problemwith an unkown number of candidates[J]. Journal of ApplicatedProbability, 1982, 19:619-630. [10] Freeman. The secretary problem and its extensions:Areview[J]. International Statistical Review, 1983, 51(2):189-206. [11] Ferguson T S. Who solved the secretary problem?[J]. Statistical Science, 1989, 4(3):282-296. [12] Surra C A. Research and theory on mate selection and premaritalrelationships in the 1980s[J]. Journal of Marriage and theFamily, 1990, 52(4):844-865. [13] Hsiau S R, Yang J R. A natural variation of the standard secretaryproblem[J]. Statistica Sinica, 2000, 10:639-646. [14] Immorlica N, Kleinberg R, Mahdian M. Secretary problems withcompeting employers[C]//WINE 2006, 2006, LNCS 4286:389-400. [15] Eriksson K, Sjostrand J, Strimling P. Optimal expected rank in atwo-sided secretary problem[J]. Operations Research, 2007,55(5):921-931. [16] El-Yaniv R, Fiat A, Karp R M, et al. Optimal search and one-waytrading online algorithms[J]. Algorithmica, 2001,30:101-139. [7] Lorenz J, Panagiotou K, Steger A. Optimal algorithms for k-searchwith application in option pricing[J]. Algorithmica, 2009,55:311-328. [18] Damaschke P, Ha P H, Tsigas P. Online search with time-varying pricebounds[J]. Algorithmica, 2009, 55:619-642. [19] Xu Y F, Zhang W M, Zheng F F. Optimal algorithms for the online timeseries search problem[J]. Theoretical Computer Science, 2011,412:192-197. [20] Zhang W M, Xu Y F, Zheng F F, et al. Optimal algorithms for onlinetime series search and one-way trading with interrelated prices[J].Journal of Combinatorial Optimization, 2012, 23(2):159-166. [21] Zhang W M, Xu Y F, Zheng F F, et al. Online algorithms for thegeneral k-search problem[J]. Information Processing Letters,2011, 111(3):678-682. [22] Zhang W M, Xu Y F, Zheng F F, et al. Online algorithms for themultiple time series search problem[J]. Computers andOperations Research, 2012, 39(5):929-938. [23] Albinali S. A risk-reward framework for the competitive analysis offinancial games[J]. Algorithmica, 1999, 25(1):99-115. [24] Dong Y C, Xu Y F, Xu W J. The online rental problem with risk andprobabilistic forecast. FAW 2007, Lecture Notes in ComputerScience, Germany:Springer Verlag, 2007:117-123. |