Offline Feature-Based Pricing Under Censored Demand: A Causal Inference Approach

被引:0
作者
Tang, Jingwen [1 ]
Qi, Zhengling [2 ]
Fang, Ethan [3 ]
Shi, Cong [1 ]
机构
[1] Univ Miami, Miami Herbert Business Sch, Dept Management, Coral Gables, FL 33146, USA
[2] George Washington Univ, Dept Decis Sci, Washington, DC 20052, USA
[3] Duke Univ, Dept Biostat & Bioinformat, Durham, NC 27708, USA
基金
美国国家科学基金会;
关键词
offline learning; feature-based pricing; demand censoring; causal inference; regret analysis; INVENTORY CONTROL; LOST SALES; LEARNING ALGORITHMS; ROBUST ESTIMATION; NEWSVENDOR; APPROXIMATION; ANALYTICS; POLICIES; SYSTEMS; BOUNDS;
D O I
10.1287/msom.2024.1061
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Problem definition: We study a feature-based pricing problem with demand censoring in an offline, data-driven setting. In this problem, a firm is endowed with a finite amount of inventory and faces a random demand that is dependent on the offered price and the features (from products, customers, or both). Any unsatisfied demand that exceeds the inventory level is lost and unobservable. The firm does not know the demand function but has access to an offline data set consisting of quadruplets of historical features, inventory, price, and potentially censored sales quantity. Our objective is to use the offline data set to find the optimal feature-based pricing rule so as to maximize the expected profit. Methodology/results: Through the lens of causal inference, we propose a novel data driven algorithm that is motivated by survival analysis and doubly robust estimation. derive a finite sample regret bound to justify the proposed offline learning algorithm prove its robustness. Numerical experiments demonstrate the robust performance of proposed algorithm in accurately estimating optimal prices on both training and testing data. Managerial implications: The work provides practitioners with an innovative modeling and algorithmic framework for the feature-based pricing problem with demand censoring through the lens of causal inference. Our numerical experiments underscore value of considering demand censoring in the context of feature-based pricing.
引用
收藏
页码:535 / 553
页数:20
相关论文
共 105 条
[1]   NONPARAMETRIC INFERENCE FOR A FAMILY OF COUNTING PROCESSES [J].
AALEN, O .
ANNALS OF STATISTICS, 1978, 6 (04) :701-726
[2]  
Agrawal N, 1996, NAV RES LOG, V43, P839, DOI 10.1002/(SICI)1520-6750(199609)43:6<839::AID-NAV4>3.0.CO
[3]  
2-5
[4]   Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management [J].
Agrawal, Shipra ;
Jia, Randy .
OPERATIONS RESEARCH, 2022,
[5]   Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity [J].
Ban, Gah-Yi ;
Keskin, N. Bora .
MANAGEMENT SCIENCE, 2021, 67 (09) :5549-5568
[6]   Doubly robust estimation in missing data and causal inference models [J].
Bang, H .
BIOMETRICS, 2005, 61 (04) :962-972
[7]  
BARRON AR, 1994, MACH LEARN, V14, P115, DOI 10.1007/BF00993164
[8]   A Note on "The Censored Newsvendor and the Optimal Acquisition of Information" [J].
Bensoussan, Alain ;
Cakanyildirim, Metin ;
Sethi, Suresh P. .
OPERATIONS RESEARCH, 2009, 57 (03) :791-794
[9]   CENSORED NEWSVENDOR MODEL REVISITED WITH UNNORMALIZED PROBABILITIES [J].
Bensoussan, Alain ;
Cakanyildirim, Metin ;
Sethi, Suresh P. .
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (02) :391-402
[10]   On Implications of Demand Censoring in the Newsvendor Problem [J].
Besbes, Omar ;
Muharremoglu, Alp .
MANAGEMENT SCIENCE, 2013, 59 (06) :1407-1424