Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources

• 成果类型: Article
• 署名作者: Baek, Jackie; Ma, Will
• 署名单位: Massachusetts Institute of Technology (MIT); Columbia University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2022.2282
• 发表日期: 2022
• 关键词: Network Revenue Management; Reusable Resources; matroid prophet inequalities; Approximate Dynamic Programming

摘要

Network revenue management (NRM) describes a general online allocation problem in which combinations of capacity-constrained resources are sold to a stream of arriving customers. Existing papers propose one-size-fits-all methods for controlling the resource capacities over time. In this paper, we study how different methods can be used to control different resource constraints based on the network structure of each instance. Specifically, we propose a heuristic that bifurcates the resources of a given NRM instance into a structured part resembling a matroid and an unstructured part. We then derive an NRM policy with an approximation ratio of 1/(2(1+L')), where L' denotes the maximum number of distinct unstructured resources required by a customer. Our approach improves theoretical and empirical performance both in applications where the structured constraints arise naturally and in randomly generated NRM instances where the structured constraints must be found by our heuristic. Along the way, our paper also provides a unified framework for analyzing NRM problems, which simplifies existing results and allows for the resources to be reusable.