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 条
  • [41] Modeling the impact of product quality on dynamic pricing and advertising policies
    Chenavaz, Regis Y.
    Feichtinger, Gustav
    Hartl, Richard F.
    Kort, Peter M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (03) : 990 - 1001
  • [42] Sponsored Search Marketing: Dynamic Pricing and Advertising for an Online Retailer
    Ye, Shengqi
    Aydin, Goker
    Hu, Shanshan
    MANAGEMENT SCIENCE, 2015, 61 (06) : 1255 - 1274
  • [43] A Survey on Real Time Bidding Advertising
    Yuan, Yong
    Wang, Feiyue
    Li, Juanjuan
    Qin, Rui
    2014 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS (SOLI), 2014, : 418 - 423
  • [44] Optimizing the Revenue for Ad Exchanges in Header Bidding Advertising Markets
    Qin, Rui
    Yuan, Yong
    Wang, Fei-Yue
    2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2017, : 432 - 437
  • [45] Towards Dynamic Pricing for Digital Billboard Advertising Network in Smart Cities
    Lak, Parisa
    Kocak, Akin
    Pralat, Pawel
    Bener, Ayse
    Samarikhalaj, Akram
    2015 IEEE FIRST INTERNATIONAL SMART CITIES CONFERENCE (ISC2), 2015,
  • [46] Display advertising: the role of context and advertising appeals from a resistance perspective
    Tsiotsou, Rodoula H.
    Hatzithomas, Leonidas
    Wetzels, Martin
    JOURNAL OF RESEARCH IN INTERACTIVE MARKETING, 2024, 18 (02) : 198 - 219
  • [47] Goal-Based Categorization: Dynamic Classification in the Display Advertising Industry
    Glaser, Vern L.
    Atkinson, Mariam Krikorian
    Fiss, Peer C.
    ORGANIZATION STUDIES, 2020, 41 (07) : 921 - 943
  • [48] Heuristic optimization algorithms for advertising campaigns
    Seco, Alvaro
    Lopez, Natalia
    Rubio, Fernando
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 266
  • [49] Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
    Savas Dayanik
    Semih O. Sezer
    Mathematical Methods of Operations Research, 2023, 97 : 25 - 56
  • [50] Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
    Dayanik, Savas
    Sezer, Semih O.
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 97 (01) : 25 - 56