| Uniformly bounded regret in the multisecretary problem A Arlotto, I Gurvich Stochastic Systems 9 (3), 231-260, 2019 | 92 | 2019 |
| Optimal hiring and retention policies for heterogeneous workers who learn A Arlotto, SE Chick, N Gans Management Science 60 (1), 110-129, 2014 | 68 | 2014 |
| Hessian orders and multinormal distributions A Arlotto, M Scarsini Journal of Multivariate Analysis 100 (10), 2324-2330, 2009 | 30 | 2009 |
| Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards A Arlotto, X Xie arXiv preprint arXiv:1809.02016, 2018 | 27 | 2018 |
| Markov decision problems where means bound variances A Arlotto, N Gans, JM Steele Operations Research 62 (4), 864-875, 2014 | 26 | 2014 |
| Optimal online selection of a monotone subsequence: a central limit theorem A Arlotto, VV Nguyen, JM Steele Stochastic Processes and their Applications 125 (9), 3596-3622, 2015 | 24 | 2015 |
| Strategic Open Routing in Service Networks A Arlotto, AE Frazelle, Y Wei Management Science, 2018 | 17* | 2018 |
| Quickest online selection of an increasing subsequence of specified size A Arlotto, E Mossel, JM Steele Random Structures & Algorithms 49 (2), 235-252, 2016 | 16 | 2016 |
| Optimal sequential selection of a unimodal subsequence of a random sequence A Arlotto, JM Steele Combinatorics Probability and Computing 20 (6), 799 - 814, 2011 | 16 | 2011 |
| Optimal employee retention when inferring unknown learning curves A Arlotto, N Gans, S Chick Proceedings of the 2010 winter simulation conference, 1178-1188, 2010 | 14 | 2010 |
| Beardwood–Halton–Hammersley theorem for stationary ergodic sequences: a counterexample A Arlotto, JM Steele | 13 | 2016 |
| An adaptive O (log n)‐optimal policy for the online selection of a monotone subsequence from a random sample A Arlotto, Y Wei, X Xie Random Structures & Algorithms 52 (1), 41-53, 2018 | 12 | 2018 |
| A central limit theorem for temporally nonhomogenous markov chains with applications to dynamic programming A Arlotto, JM Steele Mathematics of Operations Research 41 (4), 1448-1468, 2016 | 12 | 2016 |
| Online selection of alternating subsequences from a random sample A Arlotto, RW Chen, LA Shepp, JM Steele Journal of applied probability 48 (4), 1114-1132, 2011 | 12 | 2011 |
| Optimal online selection of an alternating subsequence: A central limit theorem A Arlotto, JM Steele Advances in Applied Probability 46 (2), 536-559, 2014 | 8 | 2014 |
| Dynamic resource allocation: The geometry and robustness of constant regret A Vera, A Arlotto, I Gurvich, E Levin Mathematics of Operations Research, 2024 | 5 | 2024 |
| Online demand fulfillment problem with initial inventory placement: A regret analysis A Arlotto, IN Keskin, Y Wei Available at SSRN 4666493, 2023 | 3 | 2023 |
| A Central Limit Theorem for Costs in Bulinskaya’s Inventory Management Problem When Deliveries Face Delays A Arlotto, JM Steele Methodology and Computing in Applied Probability 20 (3), 839-854, 2018 | 1 | 2018 |
| Ballot Design and Electoral Outcomes: The Role of Candidate Order and Party Affiliation A Arlotto, A Belloni, F Fang, S Pekec | | 2024 |
| Essays in problems of optimal sequential decisions A Arlotto University of Pennsylvania, 2012 | | 2012 |
J. Michael SteeleProfessor Emeritus of Statistics, Wharton School, University of PennsylvaniaCorreu electrònic verificat a wharton.upenn.edu
