The main focus of this paper is on the problem of maximizing the Nash social welfare (NSW).
In particular, given a collection of indivisible goods that needs to be allocated to a set of …

This paper studies the cloud market for computing jobs with completion deadlines, and
designs efficient online auctions for cloud resource provisioning. A cloud user bids for future …

We present online algorithms for covering and packing problems with (non-linear) convex
objectives. The convex covering problem is defined as: min xϵ R+ nf (x) st Ax≥ 1, where f …

Auction design has recently been studied for dynamic resource bundling and virtual
machine (VM) provisioning in IaaS clouds, but is mostly restricted to one-shot or offline …

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 …

Auction design has recently been studied for dynamic resource bundling and VM
provisioning in IaaS clouds, but is mostly restricted to the one-shot or offline setting. This …

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 …

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 …

With the recent advent of network functions virtualization (NFV), enterprises and businesses
are looking into network service provisioning through the service chains of virtual network …