2 papers
cs.AI2023
Fully Dynamic Online Selection through Online Contention Resolution Schemes
Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi +2
We study fully dynamic online selection problems in an adversarial/stochastic setting that includes Bayesian online selection, prophet inequalities, posted price mechanisms, and st…
cs.LG2021
Top Ranking for Multi-Armed Bandit with Noisy Evaluations
Evrard Garcelon, Vashist Avadhanula, Alessandro Lazaric +1
We consider a multi-armed bandit setting where, at the beginning of each round, the learner receives noisy independent, and possibly biased, \emph{evaluations} of the true reward o…