Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications of Alessandro Arlotto    :chronological  alphabetical  combined  bibtex listing:

Papers Published

  1. Arlotto, A; Steele, JM, A Central Limit Theorem for Costs in Bulinskaya’s Inventory Management Problem When Deliveries Face Delays, Methodology and Computing in Applied Probability, vol. 20 no. 3 (September, 2018), pp. 839-854 [doi]  [abs]
  2. Arlotto, A; Wei, Y; Xie, X, An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample, Random Structures & Algorithms, vol. 52 no. 1 (January, 2018), pp. 41-53, Wiley [doi]  [abs]
  3. Arlotto, A; Xie, X, Logarithmic regret in the dynamic and stochastic knapsack problem., Corr, vol. abs/1809.02016 (2018)
  4. Arlotto, A; Frazelle, AE; Wei, Y, Strategic open routing in service networks, Management Science (2018), INFORMS
  5. Arlotto, A; Gurvich, I, Uniformly bounded regret in the multi-secretary problem (October, 2017)  [abs]
  6. Arlotto, A; Steele, JM, A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming, Mathematics of Operations Research, vol. 41 no. 4 (November, 2016), pp. 1448-1468, Institute for Operations Research and the Management Sciences (INFORMS) [doi]
  7. Arlotto, A; Mossel, E; Steele, JM, Quickest online selection of an increasing subsequence of specified size, Random Structures & Algorithms, vol. 49 no. 2 (September, 2016), pp. 235-252, WILEY [doi]
  8. Arlotto, A; Steele, JM, Beardwood–Halton–Hammersley theorem for stationary ergodic sequences: A counterexample, The Annals of Applied Probability, vol. 26 no. 4 (August, 2016), pp. 2141-2168, Institute of Mathematical Statistics [doi]
  9. Arlotto, A; Nguyen, VV; Steele, JM, Optimal online selection of a monotone subsequence: a central limit theorem, Stochastic Processes and Their Applications, vol. 125 no. 9 (September, 2015), pp. 3596-3622, Elsevier BV [doi]
  10. Arlotto, A; Gans, N; Steele, JM, Markov Decision Problems Where Means Bound Variances, Operations Research, vol. 62 no. 4 (August, 2014), pp. 864-875, Institute for Operations Research and the Management Sciences (INFORMS) [doi]
  11. Arlotto, A; Steele, JM, Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem, Advances in Applied Probability, vol. 46 no. 02 (June, 2014), pp. 536-559, Cambridge University Press (CUP) [doi]  [abs]
  12. Arlotto, A; Chick, SE; Gans, N, Optimal Hiring and Retention Policies for Heterogeneous Workers Who Learn, Management Science, vol. 60 no. 1 (January, 2014), pp. 110-129, Institute for Operations Research and the Management Sciences (INFORMS) [doi]
  13. Arlotto, A; Chen, RW; Shepp, LA; Steele, JM, Online Selection of Alternating Subsequences from a Random Sample, Journal of Applied Probability, vol. 48 no. 04 (December, 2011), pp. 1114-1132, Cambridge University Press (CUP) [doi]  [abs]
  14. ARLOTTO, ALESSANDRO; STEELE, JMICHAEL, Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence, Combinatorics, Probability and Computing, vol. 20 no. 06 (November, 2011), pp. 799-814, Cambridge University Press (CUP) [doi]  [abs]
  15. Arlotto, A; Gans, N; Chick, S, Optimal employee retention when inferring unknown learning curves, edited by Johansson, B; Jain, S; Montoya-Torres, J; Hugan, J; Yücesan, E, Proceedings of the 2010 Winter Simulation Conference (December, 2010), pp. 1178-1188, IEEE [doi]  [abs]
  16. Arlotto, A; Scarsini, M, Hessian orders and multinormal distributions, Journal of Multivariate Analysis, vol. 100 no. 10 (November, 2009), pp. 2324-2330, Elsevier BV [doi]  [abs]
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320