Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals

02/16/2023
by   Zihao Li, et al.
0

We study an edge-weighted online stochastic Generalized Assignment Problem with unknown Poisson arrivals. In this model, we consider a bipartite graph that contains offline bins and online items, where each offline bin is associated with a D-dimensional capacity vector and each online item is with a D-dimensional demand vector. Online arrivals are sampled from a set of online item types which follow independent but not necessarily identical Poisson processes. The arrival rate for each Poisson process is unknown. Each online item will either be packed into an offline bin which will deduct the allocated bin's capacity vector and generate a reward, or be rejected. The decision should be made immediately and irrevocably upon its arrival. Our goal is to maximize the total reward of the allocation without violating the capacity constraints. We provide a sample-based multi-phase algorithm by utilizing both pre-existing offline data (named historical data) and sequentially revealed online data. We establish its performance guarantee measured by a competitive ratio. In a simplified setting where D=1 and all capacities and demands are equal to 1, we prove that the ratio depends on the number of historical data size and the minimum number of arrivals for each online item type during the planning horizon, from which we analyze the effect of the historical data size and the Poisson arrival model on the algorithm's performance. We further generalize the algorithm to the general multidimensional and multi-demand setting, and present its parametric performance guarantee. The effect of the capacity's (demand's) dimension on the algorithm's performance is further analyzed based on the established parametric form. Finally, we demonstrate the effectiveness of our algorithms numerically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2021

Online Stochastic Matching, Poisson Arrivals, and the Natural Linear Program

We study the online stochastic matching problem. Consider a bipartite gr...
research
09/01/2022

Online Demand Scheduling with Failovers

Motivated by cloud computing applications, we study the problem of how t...
research
12/01/2020

Improved Online Algorithms for Knapsack and GAP in the Random Order Model

The knapsack problem is one of the classical problems in combinatorial o...
research
11/18/2019

Online Learning and Matching for Resource Allocation Problems

In order for an e-commerce platform to maximize its revenue, it must rec...
research
05/02/2018

Greedy Bipartite Matching in Random Type Poisson Arrival Model

We introduce a new random input model for bipartite matching which we ca...
research
05/15/2023

Size-stochastic Knapsack Online Contention Resolution Schemes

Online contention resolution schemes (OCRSs) are effective rounding tech...
research
08/09/2023

MNL-Prophet: Sequential Assortment Selection under Uncertainty

Due to numerous applications in retail and (online) advertising the prob...

Please sign up or login with your details

Forgot password? Click here to reset