10 problems

In an $epsilon$-global differentially private stochastic bandit, an algorithm is said to forget when it discards past rewards between independent episodes. Forgetting-necessity con…

In a two-way dynamic matching network, let $\mathbf{TP}$ denote the local availability-based policy proposed by Kerimov et al. The policy makes matching decisions using agent avail…

Let $T$ denote the number of units in a finite-population adaptive randomized controlled trial, and let $\widetilde{O}(\sqrt{T})$ denote a regret rate up to polylogarithmic factors…

Relative-regret extension conjecture. The paper's techniques should still apply to the relative regret metric.

The ergodic Avellaneda–Stoikov market-making model is assumed to describe market behaviour up to an unknown parameter, and the optimal control derived from maximum-likelihood estim…

Let $M$ denote the number of observed trajectories, and let $\hat{Q}_{10}$ and $\hat{P}$ be, respectively, highly aggregated and more finely aggregated models of the same deteriora…

Let $T$ be the time horizon. In the finite-type multi-secretary problem, candidates have abilities drawn from a distribution with finitely many types, and regret measures the loss…

Gradient-strategy conjecture.

Let $u$ be the value function, let $P(N)$ denote the admissible expert subsets, and define the set of Hamiltonian maximizers by … For $x\in\mathbb{R}^4$ and stopping parameter…

Let $K$-armed bandit means satisfy $mu_1>mu_2$ and suppose that $mu_1$ and $mu_2$ are much larger than the other means. Worst-case ETC conjecture. In this regime, the regret of an…