8 problems

The deterministic $k$-server conjecture. There exists a deterministic online algorithm for the $k$-server problem with competitive ratio $k$.

Randomized metrical task systems conjecture. The asymptotically tight $\Theta(\log n)$ competitive-ratio bound holds in all metric spaces.

PID controllers are studied under a real-roots assumption on the transfer function, while the experiments include parameter choices that do not satisfy this assumption and neverthe…

Consider an online allocation problem with stochastic and adversarial input models. An algorithm has vanishing regret under stochastic input when its regret tends to zero, and has…

The algorithms considered use different amounts of information about the hitting-cost function: OBD PLUS uses projection onto different level sets, Weighted Greedy queries gradient…

Consider the proposed offline and online algorithms for the energy plan selection problem, including the 3-competitive deterministic algorithm and the 2-competitive randomized algo…

Let $\text{sffamily L}$ be the maximum length of a fixed-rate plan, let $\textbf{dSP}$ denote the dynamic energy plan selection problem with cancellation fees, and let…

Let $d4a6$ denote the family of convex sets in $d53d^d$, let $d4a6^*$ be the set of finite strings with alphabet $d4a6$, and let an online selector be a map $S:d4a6^*\tod53d^d$ sat…