暂无分享,去创建一个
[1] K. Talluri,et al. The Theory and Practice of Revenue Management , 2004 .
[2] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.
[3] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[4] R. Srikant,et al. Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits , 2015, NIPS.
[5] Anton J. Kleywegt,et al. The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..
[6] Dimitri P. Bertsekas,et al. Stochastic optimal control : the discrete time case , 2007 .
[7] P. Rousseeuw,et al. Wiley Series in Probability and Mathematical Statistics , 2005 .
[8] David Lindley,et al. Dynamic Programming and Decision Theory , 1961 .
[9] P. R. Kumar. Stability of Queueing Networks and , 1995 .
[10] S. M. Samuels,et al. Optimal selection based on relative rank (the “secretary problem”) , 1964 .
[11] Mathematical Questions, with their Solutions, from the “Educational Times” , 1877, Nature.
[12] F. Mosteller,et al. Recognizing the Maximum of a Sequence , 1966 .
[13] G. Louchard,et al. Sequential selection of the κ best out of n rankable objects , 2016 .
[14] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[15] Nathan Ross. Fundamentals of Stein's method , 2011, 1109.1880.
[16] Arnab Chakraborty,et al. The secretary problem , 1996 .
[17] Mihalis Yannakakis,et al. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems , 2007, APPROX-RANDOM.
[18] P. Freeman. The Secretary Problem and its Extensions: A Review , 1983 .
[19] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .
[20] D. Down,et al. Stability of Queueing Networks , 1994 .