Nonparametric advertising budget allocation with inventory constraint

被引:11
作者
Yang, Chaolin [1 ]
Xiong, Yi [2 ]
机构
[1] Shanghai Univ Finance & Econ, Sch Informat Management & Engn, Res Inst Interdisciplinary Sci, Shanghai, Peoples R China
[2] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Revenue management; Advertising budget allocation; Nonparametric; Dynamic learning; Asymptotic optimality; NETWORK REVENUE MANAGEMENT; PRODUCTS; DECISION; DEMAND; MODEL;
D O I
10.1016/j.ejor.2020.02.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we study the optimization problem of the advertising budget allocation for revenue management faced by a marketer. Besides the advertising budget, the marketer is subject to an inventory constraint during the promotion season. The marketer can affect sales by spending on advertising but does not initially know the relationship between the advertising expense and consequent sales. We propose a nonparametric learning-while-doing budget allocation policy for the problem. Specifically, we first conduct a sequence of advertising experiments to learn (predict) the market sales response through observing realized sales (exploration), then based on the learned sales function determine the following budget allocation planning (exploitation). In particular, during the exploration and exploitation phases, we need to balance the advertising and inventory budgets simultaneously. We show that our policy is asymptotically optimal as the size of the market increases. By constructing a worst-case example, we show that our policy achieves near-best asymptotic performance. We also provide numerical illustrations to show how our policy works, and discuss how its performance changes as the system parameters vary. We also glen some managerial implications of our model and policy from the numerical results. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:631 / 641
页数:11
相关论文
共 39 条
[1]  
Amin K., 2012, P 28 C UNC ART INT C, P54
[2]  
[Anonymous], 2005, The Theory and Practice of Revenue Management
[3]  
[Anonymous], [No title captured]
[4]   Dynamic Pricing for Nonperishable Products with Demand Learning [J].
Araman, Victor F. ;
Caldentey, Rene .
OPERATIONS RESEARCH, 2009, 57 (05) :1169-1188
[5]   Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design [J].
Balseiro, Santiago R. ;
Besbes, Omar ;
Weintraub, Gabriel Y. .
MANAGEMENT SCIENCE, 2015, 61 (04) :864-884
[6]   Multistage multiproduct advertising budgeting [J].
Beltran-Royo, C. ;
Zhang, H. ;
Blanco, L. A. ;
Almagro, J. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 225 (01) :179-188
[7]   On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning [J].
Besbes, Omar ;
Zeevi, Assaf .
MANAGEMENT SCIENCE, 2015, 61 (04) :723-739
[8]   Blind Network Revenue Management [J].
Besbes, Omar ;
Zeevi, Assaf .
OPERATIONS RESEARCH, 2012, 60 (06) :1537-1550
[9]   Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms [J].
Besbes, Omar ;
Zeevi, Assaf .
OPERATIONS RESEARCH, 2009, 57 (06) :1407-1420
[10]   Dynamic Pricing Under a General Parametric Choice Model [J].
Broder, Josef ;
Rusmevichientong, Paat .
OPERATIONS RESEARCH, 2012, 60 (04) :965-980