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 条
  • [31] Strategic bidding for Cloud resources under Dynamic Pricing schemes
    Sowmya, K.
    Sundarraj, R. P.
    2012 INTERNATIONAL SYMPOSIUM ON CLOUD AND SERVICES COMPUTING (ISCOS 2012), 2012, : 25 - 30
  • [32] An Actor-critic Reinforcement Learning Model for Optimal Bidding in Online Display Advertising
    Yuan, Congde
    Guo, Mengzhuo
    Xiang, Chaoneng
    Wang, Shuangyang
    Song, Guoqing
    Zhang, Qingpeng
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 3604 - 3613
  • [33] Bid-Aware Active Learning in Real-Time Bidding for Display Advertising
    Liu, Shuhao
    Yu, Yong
    IEEE ACCESS, 2020, 8 : 26561 - 26572
  • [34] A joint dynamic pricing and advertising model of perishable products
    Feng, Lin
    Zhang, Jianxiong
    Tang, Wansheng
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (08) : 1341 - 1351
  • [35] Stochastic dynamic pricing and advertising in isoelastic oligopoly models
    Schlosser, Rainer
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (03) : 1144 - 1155
  • [36] Autonomous and advertising-dependent 'word of mouth' under costly dynamic pricing
    El Ouardighi, Fouad
    Feichtinger, Gustav
    Grass, Dieter
    Hartl, Richard
    Kort, Peter M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (03) : 860 - 872
  • [37] A 2020 perspective on "A novel methodology for optimizing display advertising campaigns using genetic algorithms"
    Miralles-Pechuan, Luis
    Ponce, Hiram
    Martinez-Villasenor, Lourdes
    ELECTRONIC COMMERCE RESEARCH AND APPLICATIONS, 2020, 40
  • [38] Bidding-Based Dynamic Power Pricing Scheme in Smart Grids
    Ward, Andrew
    Zhou, Zhengyuan
    Bambos, Nicholas
    2019 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2019, : 729 - 734
  • [39] Exploring Time-Series Forecasting Models for Dynamic Pricing in Digital Signage Advertising
    Tan, Yee-Fan
    Ong, Lee-Yeng
    Leow, Meng-Chew
    Goh, Yee-Xian
    FUTURE INTERNET, 2021, 13 (10)
  • [40] Dynamic vs. static pricing in a supply chain with advertising
    Zhang, Jianxiong
    Lei, Liyan
    Zhang, Shichen
    Song, Lijun
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 109 : 266 - 279