Online allocation problems with resource constraints have a rich history in computer science
and operations research. In this paper, we introduce the regularized online allocation …

We introduce and study a general version of the fractional online knapsack problem with
multiple knapsacks, heterogeneous constraints on which items can be assigned to which …

The online knapsack problem is a classic online resource allocation problem in networking
and operations research. Its basic version studies how to pack online arriving items of …

Network slicing is the key to enable virtualized resource sharing among vertical industries in
the era of 5G communication. Efficient resource allocation is of vital importance to realize …

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 …

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

This research aims to design an optimal and strategyproof mechanism for online resource
allocation problems. In such problems, consumers randomly arrive with their resource …

With the rapid acceleration of transportation electrification, public charging stations are
becoming vital infrastructure in smart sustainable cities to provide on-demand electric …

Multi-server jobs are imperative in modern cloud computing systems. A noteworthy feature of
multi-server jobs is that, they usually request multiple computing devices simultaneously for …

We study the optimal control problem in stochastic queueing networks with a set of job
dispatchers connected to a set of parallel servers with queues. Jobs arrive at the dispatchers …