Search Results for author:
Found 5 papers, 1 papers with code
On Preemption and Learning in Stochastic Scheduling
We study single-machine scheduling of jobs, each belonging to a job type that determines its duration distribution.
Robust Estimation of Discrete Distributions under Local Differential Privacy
We consider the problem of estimating a discrete distribution in total variation from $n$ contaminated data batches under a local differential privacy constraint.
Pure Exploration and Regret Minimization in Matching Bandits
Finding an optimal matching in a weighted graph is a standard combinatorial problem.
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i. i. d., but they have fixed degree distributions -- the so-called configuration model.
Decentralized Learning in Online Queuing Systems
In the centralized case, the number of accumulated packets remains bounded (i. e., the system is \textit{stable}) as long as the ratio between service rates and arrival rates is larger than $1$.
