Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations

10/08/2020
by   Vineet Goyal, et al.
0

We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources are used or rented for a stochastic duration that is drawn independently from known distributions. Focusing on the case of large inventory, we give an algorithm that is (1-1/e) competitive for general usage distributions. At the heart of our result is the notion of a relaxed online algorithm that is only subjected to fluid approximations of the stochastic elements in the problem. The output of this algorithm serves as a guide for the final algorithm. This leads to a principled approach for seamlessly addressing stochastic elements (such as reusability, customer choice, and combinations thereof) in online resource allocation problems, that may be useful more broadly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2020

Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio

We study the problem of allocating a given set of resources to sequentia...
research
09/30/2018

Online Resource Allocation under Partially Predictable Demand

For online resource allocation problems, we propose a new demand arrival...
research
12/23/2020

Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs

We study the problem of online resource allocation, where multiple custo...
research
06/27/2022

Online Resource Allocation under Horizon Uncertainty

We study stochastic online resource allocation: a decision maker needs t...
research
05/25/2022

Uniformly Bounded Regret in Dynamic Fair Allocation

We study a dynamic allocation problem in which T sequentially arriving d...
research
04/06/2023

Leveraging Reusability: Improved Competitive Ratio of Greedy for Reusable Resources

We study online weighted bipartite matching of reusable resources where ...
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...

Please sign up or login with your details

Forgot password? Click here to reset