Alessandro Arlotto

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Strategic Open Routing in Service Networks.
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.
Random Struct. Algorithms, 2018

Logarithmic regret in the dynamic and stochastic knapsack problem.
CoRR, 2018

2017
Uniformly bounded regret in the multi-secretary problem.
CoRR, 2017

2016
Quickest online selection of an increasing subsequence of specified size.
Random Struct. Algorithms, 2016

A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming.
Math. Oper. Res., 2016

2014
Optimal Hiring and Retention Policies for Heterogeneous Workers Who Learn.
Manag. Sci., 2014

Markov Decision Problems Where Means Bound Variances.
Oper. Res., 2014

2011
Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence.
Comb. Probab. Comput., 2011

2010
Optimal employee retention when inferring unknown learning curves.
Proceedings of the 2010 Winter Simulation Conference, 2010

2009
Hessian orders and multinormal distributions.
J. Multivar. Anal., 2009


  Loading...