IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v285y2020i2p631-641.html
   My bibliography  Save this article

Nonparametric advertising budget allocation with inventory constraint

Author

Listed:
  • Yang, Chaolin
  • Xiong, Yi

Abstract

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.

Suggested Citation

  • Yang, Chaolin & Xiong, Yi, 2020. "Nonparametric advertising budget allocation with inventory constraint," European Journal of Operational Research, Elsevier, vol. 285(2), pages 631-641.
  • Handle: RePEc:eee:ejores:v:285:y:2020:i:2:p:631-641
    DOI: 10.1016/j.ejor.2020.02.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720301235
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.02.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Omar Besbes & Assaf Zeevi, 2012. "Blind Network Revenue Management," Operations Research, INFORMS, vol. 60(6), pages 1537-1550, December.
    2. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
    3. Duncan M. Holthausen, Jr. & Gert Assmus, 1982. "Advertising Budget Allocation under Uncertainty," Management Science, INFORMS, vol. 28(5), pages 487-499, May.
    4. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    5. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    6. Yanwu Yang & Daniel Zeng & Yinghui Yang & Jie Zhang, 2015. "Optimal Budget Allocation Across Search Advertising Markets," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 285-300, May.
    7. Peter Doyle & John Saunders, 1990. "Multiproduct Advertising Budgeting," Marketing Science, INFORMS, vol. 9(2), pages 97-113.
    8. Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
    9. G. E. Fruchter & W. Dou, 2005. "Optimal Budget Allocation over Time for Keyword Ads in Web Portals," Journal of Optimization Theory and Applications, Springer, vol. 124(1), pages 157-174, January.
    10. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    11. J. Michael Harrison & N. Bora Keskin & Assaf Zeevi, 2012. "Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution," Management Science, INFORMS, vol. 58(3), pages 570-586, March.
    12. Leonard M. Lodish & Ellen Curtis & Michael Ness & M. Kerry Simpson, 1988. "Sales Force Sizing and Deployment Using a Decision Calculus Model at Syntex Laboratories," Interfaces, INFORMS, vol. 18(1), pages 5-20, February.
    13. M. L. Vidale & H. B. Wolfe, 1957. "An Operations-Research Study of Sales Response to Advertising," Operations Research, INFORMS, vol. 5(3), pages 370-381, June.
    14. Du, Rong & Hu, Qiying & Ai, Shizhong, 2007. "Stochastic optimal budget decision for advertising considering uncertain sales responses," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1042-1054, December.
    15. Chaoxu Tong & Huseyin Topaloglu, 2014. "On the Approximate Linear Programming Approach for Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 121-134, February.
    16. Tunuguntla, Vaishnavi & Basu, Preetam & Rakshit, Krishanu & Ghosh, Debabrata, 2019. "Sponsored search advertising and dynamic pricing for perishable products under inventory-linked customer willingness to pay," European Journal of Operational Research, Elsevier, vol. 276(1), pages 119-132.
    17. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    18. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    19. Kumar, Subodha & Sethi, Suresh P., 2009. "Dynamic pricing and advertising for web content providers," European Journal of Operational Research, Elsevier, vol. 197(3), pages 924-944, September.
    20. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    21. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    22. Wang Chi Cheung & David Simchi-Levi & He Wang, 2017. "Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation," Operations Research, INFORMS, vol. 65(6), pages 1722-1731, December.
    23. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    24. Beltran-Royo, C. & Zhang, H. & Blanco, L.A. & Almagro, J., 2013. "Multistage multiproduct advertising budgeting," European Journal of Operational Research, Elsevier, vol. 225(1), pages 179-188.
    25. Marc Fischer & Sönke Albers & Nils Wagner & Monika Frie, 2011. "Practice Prize Winner --Dynamic Marketing Budget Allocation Across Countries, Products, and Marketing Activities," Marketing Science, INFORMS, vol. 30(4), pages 568-585, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yanwu Yang & Baozhu Feng & Joni Salminen & Bernard J. Jansen, 2022. "Optimal advertising for a generalized Vidale–Wolfe response model," Electronic Commerce Research, Springer, vol. 22(4), pages 1275-1305, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sentao Miao & Xi Chen & Xiuli Chao & Jiaxi Liu & Yidong Zhang, 2022. "Context‐based dynamic pricing with online clustering," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3559-3575, September.
    2. Yiwei Chen & Cong Shi, 2023. "Network revenue management with online inverse batch gradient descent method," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2123-2137, July.
    3. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    4. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    5. Ningyuan Chen & Guillermo Gallego, 2021. "Nonparametric Pricing Analytics with Customer Covariates," Operations Research, INFORMS, vol. 69(3), pages 974-984, May.
    6. Arnoud V. den Boer & Bert Zwart, 2015. "Dynamic Pricing and Learning with Finite Inventories," Operations Research, INFORMS, vol. 63(4), pages 965-978, August.
    7. Doan, Xuan Vinh & Lei, Xiao & Shen, Siqian, 2020. "Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications," European Journal of Operational Research, Elsevier, vol. 282(1), pages 235-251.
    8. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    9. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    10. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    11. Qi Feng & J. George Shanthikumar, 2022. "Developing operations management data analytics," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4544-4557, December.
    12. Wang Chi Cheung & David Simchi-Levi & He Wang, 2017. "Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation," Operations Research, INFORMS, vol. 65(6), pages 1722-1731, December.
    13. Arnoud V. den Boer & N. Bora Keskin, 2020. "Discontinuous Demand Functions: Estimation and Pricing," Management Science, INFORMS, vol. 66(10), pages 4516-4534, October.
    14. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    15. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    16. N. Bora Keskin & Assaf Zeevi, 2017. "Chasing Demand: Learning and Earning in a Changing Environment," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 277-307, May.
    17. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2019. "Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 601-631, May.
    18. Boxiao Chen & David Simchi-Levi & Yining Wang & Yuan Zhou, 2022. "Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information," Management Science, INFORMS, vol. 68(8), pages 5684-5703, August.
    19. Michael N. Katehakis & Yifeng Liu & Jian Yang, 2022. "A revisit to the markup practice of irreversible dynamic pricing," Annals of Operations Research, Springer, vol. 317(1), pages 77-105, October.
    20. Huanan Zhang & Cong Shi & Chao Qin & Cheng Hua, 2016. "Stochastic regret minimization for revenue management problems with nonstationary demands," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 433-448, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:285:y:2020:i:2:p:631-641. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.