Alessandro Arlotto

Available identifiers

Publication	Date of Publication	Type
Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards	2020-09-04	Paper
Uniformly Bounded Regret in the Multisecretary Problem	2020-06-18	Paper
A central limit theorem for costs in Bulinskaya's inventory management problem when deliveries face delays	2018-11-08	Paper
An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample	2018-01-16	Paper
Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample	2016-11-16	Paper
A central limit theorem for temporally nonhomogenous Markov chains with applications to dynamic programming	2016-11-16	Paper
Quickest online selection of an increasing subsequence of specified size	2016-09-15	Paper
Optimal online selection of a monotone subsequence: a central limit theorem	2015-08-19	Paper
Markov Decision Problems Where Means Bound Variances	2014-11-26	Paper
Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem	2014-07-10	Paper
Online Selection of Alternating Subsequences from a Random Sample	2012-01-04	Paper
Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence	2011-12-08	Paper
Hessian orders and multinormal distributions	2009-11-13	Paper

This page was built for person: Alessandro Arlotto