Alessandro Arlotto

According to our database, Alessandro Arlotto authored at least 11 papers between 2009 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Strategic Open Routing in Service Networks.

Alessandro Arlotto, Andrew E. Frazelle, Yehua Wei

Manag. Sci., 2019

2018

An adaptive <i>O</i>(log <i>n</i>)-optimal policy for the online selection of a monotone subsequence from a random sample.

Alessandro Arlotto, Yehua Wei, Xinchang Xie

Random Struct. Algorithms, 2018

Logarithmic regret in the dynamic and stochastic knapsack problem.

Alessandro Arlotto, Xinchang Xie

CoRR, 2018

2017

Uniformly bounded regret in the multi-secretary problem.

Alessandro Arlotto, Itai Gurvich

CoRR, 2017

2016

Quickest online selection of an increasing subsequence of specified size.

Alessandro Arlotto, Elchanan Mossel, J. Michael Steele

Random Struct. Algorithms, 2016

A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming.

Alessandro Arlotto, J. Michael Steele

Math. Oper. Res., 2016

2014

Optimal Hiring and Retention Policies for Heterogeneous Workers Who Learn.

Alessandro Arlotto, Stephen E. Chick, Noah Gans

Manag. Sci., 2014

Markov Decision Problems Where Means Bound Variances.

Alessandro Arlotto, Noah Gans, J. Michael Steele

Oper. Res., 2014

2011

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence.

Alessandro Arlotto, J. Michael Steele

Comb. Probab. Comput., 2011

2010

Optimal employee retention when inferring unknown learning curves.

Alessandro Arlotto, Noah Gans, Stephen E. Chick

Proceedings of the 2010 Winter Simulation Conference, 2010

2009

Hessian orders and multinormal distributions.

Alessandro Arlotto, Marco Scarsini

J. Multivar. Anal., 2009