×

Arlotto, Alessandro

Author ID: arlotto.alessandro Recent zbMATH articles by "Arlotto, Alessandro"
Published as: Arlotto, Alessandro
External Links: MGP
Documents Indexed: 13 Publications since 2009
Co-Authors: 10 Co-Authors with 13 Joint Publications
445 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 74 times in 49 Documents Cited by Year
Hessian orders and multinormal distributions. Zbl 1177.60020
Arlotto, Alessandro; Scarsini, Marco
12
2009
Markov decision problems where means bound variances. Zbl 1302.90240
Arlotto, Alessandro; Gans, Noah; Steele, J. Michael
11
2014
Optimal online selection of a monotone subsequence: a central limit theorem. Zbl 1327.60053
Arlotto, Alessandro; Nguyen, Vinh V.; Steele, J. Michael
11
2015
Optimal sequential selection of a unimodal subsequence of a random sequence. Zbl 1229.60050
Arlotto, Alessandro; Steele, J. Michael
7
2011
Uniformly bounded regret in the multisecretary problem. Zbl 1446.60033
Arlotto, Alessandro; Gurvich, Itai
7
2019
Online selection of alternating subsequences from a random sample. Zbl 1258.90103
Arlotto, Alessandro; Chen, Robert W.; Shepp, Lawrence A.; Steele, J. Michael
6
2011
Quickest online selection of an increasing subsequence of specified size. Zbl 1347.60042
Arlotto, Alessandro; Mossel, Elchanan; Steele, J. Michael
6
2016
An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample. Zbl 1387.60014
Arlotto, Alessandro; Wei, Yehua; Xie, Xinchang
5
2018
A central limit theorem for temporally nonhomogenous Markov chains with applications to dynamic programming. Zbl 1352.60030
Arlotto, Alessandro; Steele, J. Michael
3
2016
Optimal online selection of an alternating subsequence: a central limit theorem. Zbl 1317.60011
Arlotto, Alessandro; Steele, J. Michael
3
2014
Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample. Zbl 1375.60036
Arlotto, Alessandro; Steele, J. Michael
2
2016
Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards. Zbl 1441.90103
Arlotto, Alessandro; Xie, Xinchang
1
2020
Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards. Zbl 1441.90103
Arlotto, Alessandro; Xie, Xinchang
1
2020
Uniformly bounded regret in the multisecretary problem. Zbl 1446.60033
Arlotto, Alessandro; Gurvich, Itai
7
2019
An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample. Zbl 1387.60014
Arlotto, Alessandro; Wei, Yehua; Xie, Xinchang
5
2018
Quickest online selection of an increasing subsequence of specified size. Zbl 1347.60042
Arlotto, Alessandro; Mossel, Elchanan; Steele, J. Michael
6
2016
A central limit theorem for temporally nonhomogenous Markov chains with applications to dynamic programming. Zbl 1352.60030
Arlotto, Alessandro; Steele, J. Michael
3
2016
Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample. Zbl 1375.60036
Arlotto, Alessandro; Steele, J. Michael
2
2016
Optimal online selection of a monotone subsequence: a central limit theorem. Zbl 1327.60053
Arlotto, Alessandro; Nguyen, Vinh V.; Steele, J. Michael
11
2015
Markov decision problems where means bound variances. Zbl 1302.90240
Arlotto, Alessandro; Gans, Noah; Steele, J. Michael
11
2014
Optimal online selection of an alternating subsequence: a central limit theorem. Zbl 1317.60011
Arlotto, Alessandro; Steele, J. Michael
3
2014
Optimal sequential selection of a unimodal subsequence of a random sequence. Zbl 1229.60050
Arlotto, Alessandro; Steele, J. Michael
7
2011
Online selection of alternating subsequences from a random sample. Zbl 1258.90103
Arlotto, Alessandro; Chen, Robert W.; Shepp, Lawrence A.; Steele, J. Michael
6
2011
Hessian orders and multinormal distributions. Zbl 1177.60020
Arlotto, Alessandro; Scarsini, Marco
12
2009

Citations by Year