Airlines and other industries have been making use of sophisticated Revenue Management Systems to maximize revenue for decades. While improving the different components of these systems has been the focus of numerous studies, estimating the impact of such improvements on the revenue has been overlooked in the literature despite its practical importance. Indeed, quantifying the benefit of a change in a system serves as support for investment decisions. This is a challenging problem as it corresponds to the difference between the generated value and the value that would have been generated keeping the system as before. The latter is not observable. Moreover, the expected impact can be small in relative value. In this paper, we cast the problem as counterfactual prediction of unobserved revenue. The impact on revenue is then the difference between the observed and the estimated revenue. The originality of this work lies in the innovative application of econometric methods proposed for macroeconomic applications to a new problem setting. Broadly applicable, the approach benefits from only requiring revenue data observed for origin-destination pairs in the network of the airline at each day, before and after a change in the system is applied. We report results using real large-scale data from Air Canada. We compare a deep neural network counterfactual predictions model with econometric models. They achieve respectively 1% and 1.1% of error on the counterfactual revenue predictions, and allow to accurately estimate small impacts (in the order of 2%).
Reinforcement Learning for Intensity Control: An Application to Choice-Based Network Revenue Management
Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong(香港中文大学系统工程与工程管理系);Rotman School of Management, University of Toronto(多伦多大学罗特曼管理学院)
Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
Department of Civil and Environmental Engineering, Operations Research Center, and Institute for Data, Systems, and Society, Massachusetts Institute of Technology(土木与环境工程系、运筹中心及数据、系统与社会研究所,麻省理工学院);Department of Industrial and Enterprise Systems Engineering, Grainger College of Engineering, University of Illinois(工业与企业系统工程系、格拉inger工程学院,伊利诺伊大学);Questrom School of Business, Boston University(乔斯特罗商学院,波士顿大学)
An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models
Leonard N. Stern School of Business, New York University(纽约大学伦纳德·N·斯特恩商学院);Machine Learning Department, Carnegie Mellon University(卡内基梅隆大学机器学习系);Computer Science Department, Indiana University at Bloomington(印第安纳大学伯明顿分校计算机科学系)