Online Resource Allocation with Convex-set Machine-Learned Advice

74 Pages Posted: 26 Jun 2023

See all articles by Negin Golrezaei

Negin Golrezaei

Massachusetts Institute of Technology (MIT) - Sloan School of Management

Patrick Jaillet

Massachusetts Institute of Technology (MIT) - Electrical Engineering and Computer Science

Zijie Zhou

Massachusetts Institute of Technology - Operations Research Center

Date Written: June 21, 2023

Abstract

Decision-makers often have access to a machine-learned prediction about demand, referred to as advice, which can potentially be utilized in online decision-making processes for resource allocation. However, exploiting such advice poses challenges due to its potential inaccuracy. To address this issue, we propose a framework that enhances online resource allocation decisions with potentially unreliable machine-learned (ML) advice. We assume here that this advice is represented by a general convex uncertainty set for the demand vector.

We introduce a parameterized class of Pareto optimal online resource allocation algorithms that strike a balance between consistent and robust ratios. The consistent ratio measures the algorithm’s performance (compared to the optimal hindsight solution) when the ML advice is accurate, while the robust ratio captures performance under an adversarial demand process when the advice is inaccurate. Specifically, in a C-Pareto optimal setting, we maximize the robust ratio while ensuring that the consistent ratio is at least C. Our proposed C-Pareto optimal algorithm is an adaptive protection level algorithm, which extends the classical fixed protection level algorithm introduced in Littlewood (2005) and Ball and Queyranne (2009). Solving a complex non-convex continuous optimization problem characterizes the adaptive protection level algorithm. To complement our algorithms, we present a simple method for computing the maximum achievable consistent ratio, which serves as an estimate for the maximum value of the ML advice. Additionally, we present numerical studies to evaluate the performance of our algorithm in comparison to benchmark algorithms. The results demonstrate that by adjusting the parameter C, our algorithms effectively strike a balance between worst-case and average performance, outperforming the benchmark algorithms.

Keywords: Online Resource Allocation, Machine-learned Advice, Convex Uncertainty Set, Single-leg Revenue Management, Pareto Optimal Algorithms, Robust Ratio, Consistent Ratio

Suggested Citation

Golrezaei, Negin and Jaillet, Patrick and Zhou, Zijie, Online Resource Allocation with Convex-set Machine-Learned Advice (June 21, 2023). Available at SSRN: https://ssrn.com/abstract=4487325 or http://dx.doi.org/10.2139/ssrn.4487325

Negin Golrezaei (Contact Author)

Massachusetts Institute of Technology (MIT) - Sloan School of Management ( email )

100 Main Street
E62-416
Cambridge, MA 02142
United States
02141 (Fax)

Patrick Jaillet

Massachusetts Institute of Technology (MIT) - Electrical Engineering and Computer Science ( email )

77 Massachusetts Avenue
Cambridge, MA 02139-4307
United States

Zijie Zhou

Massachusetts Institute of Technology - Operations Research Center ( email )

77 Massachusetts Avenue
50 Memorial Drive
Cambridge, MA 02139-4307
United States

HOME PAGE: http://https://zijiezhou.mit.edu

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
41
Abstract Views
271
PlumX Metrics