Near-Optimal Bayesian Online Assortment of Reusable Resources

Abstract

Motivated by the applications of rental services in e-commerce, we consider revenue maximization in online assortment of reusable resources for a stream of arriving consumers with different types. We design competitive online algorithms with respect to the optimum online policy in the Bayesian setting, in which types are drawn independently from known heterogeneous distributions over time. In the regime where all the initial inventories are no less than c_min, our main result is a near-optimal 1-min(1/2,\sqrt{log(c_min)/c_min}) competitive algorithm for the general case of reusable resources. As a side result, by leveraging techniques from the literature on prophet inequality, we further show an improved near-optimal 1-1/\sqrt{c_min+3} competitive algorithm for the special case of non-reusable resources.

Our algorithm relies on an expected LP benchmark for the problem, solves this LP, and simulates the solution through an independent randomized rounding. The main challenge is obtaining point-wise inventory feasibility in a computationally efficient fashion from these simulation-based algorithms. To this end, we use several technical ingredients to design "discarding policies" -- one for each resource. These policies handle the trade-off between the inventory feasibility under reusability and the revenue loss of each of the resources. However, discarding a unit of a resource changes the future consumption of other resources. To handle this new challenge, we also introduce "post-processing" assortment procedures that help with designing and analyzing our discarding policies as they run in parallel, which might be of independent interest. We finally evaluate the performance of our algorithms using the numerical simulations on the synthetic data.

Keywords: Assortment optimization, Online assortment, Reusable resources, Competitive analysis, Online algorithms