Dynamic Pricing and Bidding for Display Advertising Campaigns

被引:0
|
作者
Agrawal, Narendra [1 ]
Najafi-Asadolahi, Sami [1 ]
Smith, Stephen A. [1 ]
机构
[1] Santa Clara Univ, Leavey Sch Business, ISA Dept, Santa Clara, CA 95053 USA
关键词
Markov decision processes; queueing systems; display advertising; ad exchange; ad campaigns; real-time bidding; dynamic bidding; dynamic pricing; viewer allocation; stochastic processes; PER-CLICK; GUARANTEED; OPTIMIZATION; FRAMEWORK; MARKETS;
D O I
10.1287/msom.2023.0600
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Problem definition: Managers in digital ad agencies face the complex problem of setting prices for new ad campaigns, bidding for viewers on ad exchanges, and allocating them appropriately to campaigns. We have developed an analytical methodology for optimizing the agency's profits, with uncertainties in the arrival of potential viewers and new ad campaigns and in winning bids and obtaining viewer actions on ad exchanges. Methodology/results: The ad agency manages a series of contracts with advertisers who wish to display their ads to randomly arriving targeted viewers. Advertisers differ in their delay costs and willingness to pay for obtaining various actions by these viewers. We formulate the ad agency's sequential decision problem as a Markov decision process and develop exact solutions for both finite-horizon and steady-state cases. In our numerical analysis, we find that the finite-horizon dynamic programming (DP) solutions converge quickly to time-invariant policies, which are shown to be equivalent to the steady-state solutions. We also develop and test two heuristics that allow our solution methods to be scaled for large problems. Managerial implications: Several managerial implications follow from our paper, which is the first to address this multifaceted ad agency decision problem: (i) managers can exercise three key operational levers to maximize profits: campaign pricing, bidding strategy, and the queue capacity for campaign outcomes; (ii) the effectiveness of these levers varies in different situations, as illustrated by our numerical sensitivity analysis; (iii) optimal dynamic policies that depend on the queue length deliver significantly better profits than optimal static policies; (iv) appropriately designed heuristics can provide accurate solution methods that can be scaled to accommodate the large numbers of campaign outcomes frequently requested in practice; and (v) combining ad campaigns or merging ad agencies leads to higher total profits for the ad agency, lower prices for ad campaigns, and decreased delays in obtaining campaign outcomes.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] A Markov Decision Model for Managing Display-Advertising Campaigns
    Agrawal, Narendra
    Najafi-Asadolahi, Sami
    Smith, Stephen A.
    M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2023, 25 (02) : 489 - 507
  • [2] Managing Risk of Bidding in Display Advertising
    Zhang, Haifeng
    Zhang, Weinan
    Rong, Yifei
    Ren, Kan
    Li, Wenxin
    Wang, Jun
    WSDM'17: PROCEEDINGS OF THE TENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2017, : 581 - 590
  • [3] Dynamic Bidding Strategy Based on Probabilistic Feedback in Display Advertising
    Wu, Yuzhu
    Pan, Shumin
    Zhang, Qianwen
    Xie, Jinkui
    NEURAL INFORMATION PROCESSING (ICONIP 2017), PT II, 2017, 10635 : 845 - 853
  • [4] Optimal Real-Time Bidding for Display Advertising
    Zhang, Weinan
    Yuan, Shuai
    Wang, Jun
    PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, : 1077 - 1086
  • [5] A Unified Solution to Constrained Bidding in Online Display Advertising
    He, Yue
    Chen, Xiujun
    Wu, Di
    Pan, Junwei
    Tan, Qing
    Yu, Chuan
    Xu, Jian
    Zhu, Xiaoqiang
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 2993 - 3001
  • [6] Research Progress of Real-Time Bidding for Display Advertising
    Liu M.-J.
    Yue W.
    Qiu L.-Z.
    Li J.-X.
    Qin Z.-G.
    1810, Science Press (43): : 1810 - 1841
  • [7] An expected win rate-based real-time bidding strategy for branding campaigns on display advertising
    Shih, Wen-Yueh
    Huang, Jiun-Long
    KNOWLEDGE AND INFORMATION SYSTEMS, 2019, 61 (03) : 1395 - 1430
  • [8] An expected win rate-based real-time bidding strategy for branding campaigns on display advertising
    Wen-Yueh Shih
    Jiun-Long Huang
    Knowledge and Information Systems, 2019, 61 : 1395 - 1430
  • [9] A Dynamic Bidding Strategy Based on Model-Free Reinforcement Learning in Display Advertising
    Liu, Mengjuan
    Jiaxing, Li
    Hu, Zhengning
    Liu, Jinyu
    Nie, Xuyun
    IEEE ACCESS, 2020, 8 : 213587 - 213601
  • [10] A new optimization layer for real-time bidding advertising campaigns
    Micchi, Gianluca
    Khah, Saeid Soheily
    Turner, Jacob
    INTELLIGENT DATA ANALYSIS, 2020, 24 (01) : 199 - 224