We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed
bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a …

This paper studies online algorithms augmented with multiple machine-learned predictions.
We give a generic algorithmic framework for online covering problems with multiple …

In this work, we investigate the problem of joint optimization over placement and routing of
network function chains in data centers. In the offline case, we demonstrate that a classical …

In this paper, we study the online multidimensional knapsack problem (called OMdKP) in
which there is a knapsack whose capacity is represented in m dimensions, each dimension …

We study online auctions with production costs using an online primal dual framework. The
seller allocates items to buyers and can produce multiple copies of each item subject to a …

We study a general online combinatorial auction problem in algorithmic mechanism design.
A provider allocates multiple types of capacity-limited resources to customers that arrive in a …

This paper concerns the mechanism design for online resource allocation in a strategic
setting. In this setting, a single supplier allocates capacity-limited resources to requests that …

Optimization problems often involve vector norms, which has led to extensive research on
developing algorithms that can handle objectives beyond the $\ell_p $ norms. Our work …

We study the problem of chasing positive bodies in 1: given a sequence of bodies
K_t=\left{x^t∈R_+^n∣C^tx^t≧1,P^tx^t≦1\right\} revealed online, where C^t and P^t are …

This paper studies online optimization under inventory (budget) constraints. While online
optimization is a well-studied topic, versions with inventory constraints have proven difficult …