Dynamic Pricing and Bidding for Display Advertising Campaigns

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. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0600 .

Authors

Institutions

Publication Details

Journal
Manufacturing & Service Operations Management
Published
2025-04-09
DOI
https://doi.org/10.1287/msom.2023.0600
Citations
1
Primary Topic
Consumer Market Behavior and Pricing
Type
article
Field-Weighted Citation Impact
2.07
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Pricing and Bidding for Display Advertising Campaigns

Stephen A. Smith, Sami Najafi-Asadolahi, Narendra Agrawal
1 citations
Manufacturing & Service Operations Management
Consumer Market Behavior and Pricing
2.07
article

Dynamic Pricing and Bidding for Display Advertising Campaigns

Stephen A. Smith, Sami Najafi-Asadolahi, Narendra Agrawal
article en
1 citations

Abstract

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. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0600 .

Manufacturing & Service Operations ManagementVol. 27(3)
Santa Clara University (US)
Openalex Percentile: Top 14%
Consumer Market Behavior and Pricing
2.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.