Budget planning for coupled campaigns in sponsored search auctions

Yanwu Yang, Rui Qin, Bernard Jansen, Jie Zhang, Daniel Zeng

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Budget-related decisions in sponsored search auctions are recognized as a structured decision problem rather than a simple constraint. Budget planning over several coupled campaigns (e.g., substitution and complementarity) remains a challenging but important task for advertisers. In this paper, we propose a dynamic multicampaign budget planning approach using optimal control techniques, with consideration of the substitution relationship between advertising campaigns. A three-dimensional measure of substitution relationships between campaigns is presented, namely, the overlapping degree in terms of campaign contents, promotional periods, and target regions. We also study some desirable properties and possible solutions to our budget model. Computational simulations and experiments are conducted to evaluate our model using real-world data from practical campaigns in sponsored search auctions. Experimental results show that (1) our approach outperforms the baseline strategy that is commonly used in practice; (2) coupled campaigns with a higher overlapping degree in between reduce the optimal total budget level, then reduce the optimal payoff, and reach the budgeting cap earlier than those with a less overlapping degree; and (3) the advertising effort can be seriously weakened by ignoring the degree of overlapping between campaigns.

Original languageEnglish
Pages (from-to)39-66
Number of pages28
JournalInternational Journal of Electronic Commerce
Volume18
Issue number3
DOIs
Publication statusPublished - 1 Apr 2014
Externally publishedYes

Fingerprint

Planning
Sponsored search
Auctions
Overlapping
Substitution
Advertising campaign
Complementarity
Optimal control
Experiment
Simulation
Budgeting

Keywords

  • Advertising campaigns
  • budget planning decision analysis
  • online advertising
  • operations research in marketing
  • optimal control
  • sponsored search
  • sponsored search auctions

ASJC Scopus subject areas

  • Business and International Management
  • Economics and Econometrics

Cite this

Budget planning for coupled campaigns in sponsored search auctions. / Yang, Yanwu; Qin, Rui; Jansen, Bernard; Zhang, Jie; Zeng, Daniel.

In: International Journal of Electronic Commerce, Vol. 18, No. 3, 01.04.2014, p. 39-66.

Research output: Contribution to journalArticle

Yang, Yanwu ; Qin, Rui ; Jansen, Bernard ; Zhang, Jie ; Zeng, Daniel. / Budget planning for coupled campaigns in sponsored search auctions. In: International Journal of Electronic Commerce. 2014 ; Vol. 18, No. 3. pp. 39-66.
@article{08ff06ef67414dcf8169e177315a10ee,
title = "Budget planning for coupled campaigns in sponsored search auctions",
abstract = "Budget-related decisions in sponsored search auctions are recognized as a structured decision problem rather than a simple constraint. Budget planning over several coupled campaigns (e.g., substitution and complementarity) remains a challenging but important task for advertisers. In this paper, we propose a dynamic multicampaign budget planning approach using optimal control techniques, with consideration of the substitution relationship between advertising campaigns. A three-dimensional measure of substitution relationships between campaigns is presented, namely, the overlapping degree in terms of campaign contents, promotional periods, and target regions. We also study some desirable properties and possible solutions to our budget model. Computational simulations and experiments are conducted to evaluate our model using real-world data from practical campaigns in sponsored search auctions. Experimental results show that (1) our approach outperforms the baseline strategy that is commonly used in practice; (2) coupled campaigns with a higher overlapping degree in between reduce the optimal total budget level, then reduce the optimal payoff, and reach the budgeting cap earlier than those with a less overlapping degree; and (3) the advertising effort can be seriously weakened by ignoring the degree of overlapping between campaigns.",
keywords = "Advertising campaigns, budget planning decision analysis, online advertising, operations research in marketing, optimal control, sponsored search, sponsored search auctions",
author = "Yanwu Yang and Rui Qin and Bernard Jansen and Jie Zhang and Daniel Zeng",
year = "2014",
month = "4",
day = "1",
doi = "10.2753/JEC1086-4415180302",
language = "English",
volume = "18",
pages = "39--66",
journal = "International Journal of Electronic Commerce",
issn = "1086-4415",
publisher = "M.E. Sharpe Inc.",
number = "3",

}

TY - JOUR

T1 - Budget planning for coupled campaigns in sponsored search auctions

AU - Yang, Yanwu

AU - Qin, Rui

AU - Jansen, Bernard

AU - Zhang, Jie

AU - Zeng, Daniel

PY - 2014/4/1

Y1 - 2014/4/1

N2 - Budget-related decisions in sponsored search auctions are recognized as a structured decision problem rather than a simple constraint. Budget planning over several coupled campaigns (e.g., substitution and complementarity) remains a challenging but important task for advertisers. In this paper, we propose a dynamic multicampaign budget planning approach using optimal control techniques, with consideration of the substitution relationship between advertising campaigns. A three-dimensional measure of substitution relationships between campaigns is presented, namely, the overlapping degree in terms of campaign contents, promotional periods, and target regions. We also study some desirable properties and possible solutions to our budget model. Computational simulations and experiments are conducted to evaluate our model using real-world data from practical campaigns in sponsored search auctions. Experimental results show that (1) our approach outperforms the baseline strategy that is commonly used in practice; (2) coupled campaigns with a higher overlapping degree in between reduce the optimal total budget level, then reduce the optimal payoff, and reach the budgeting cap earlier than those with a less overlapping degree; and (3) the advertising effort can be seriously weakened by ignoring the degree of overlapping between campaigns.

AB - Budget-related decisions in sponsored search auctions are recognized as a structured decision problem rather than a simple constraint. Budget planning over several coupled campaigns (e.g., substitution and complementarity) remains a challenging but important task for advertisers. In this paper, we propose a dynamic multicampaign budget planning approach using optimal control techniques, with consideration of the substitution relationship between advertising campaigns. A three-dimensional measure of substitution relationships between campaigns is presented, namely, the overlapping degree in terms of campaign contents, promotional periods, and target regions. We also study some desirable properties and possible solutions to our budget model. Computational simulations and experiments are conducted to evaluate our model using real-world data from practical campaigns in sponsored search auctions. Experimental results show that (1) our approach outperforms the baseline strategy that is commonly used in practice; (2) coupled campaigns with a higher overlapping degree in between reduce the optimal total budget level, then reduce the optimal payoff, and reach the budgeting cap earlier than those with a less overlapping degree; and (3) the advertising effort can be seriously weakened by ignoring the degree of overlapping between campaigns.

KW - Advertising campaigns

KW - budget planning decision analysis

KW - online advertising

KW - operations research in marketing

KW - optimal control

KW - sponsored search

KW - sponsored search auctions

UR - http://www.scopus.com/inward/record.url?scp=84896919989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896919989&partnerID=8YFLogxK

U2 - 10.2753/JEC1086-4415180302

DO - 10.2753/JEC1086-4415180302

M3 - Article

VL - 18

SP - 39

EP - 66

JO - International Journal of Electronic Commerce

JF - International Journal of Electronic Commerce

SN - 1086-4415

IS - 3

ER -