Keyword Targeting Optimization in Sponsored Search Advertising: Combining Selection and Matching
Huiran Li, Yanwu Yang

TL;DR
This paper develops a novel stochastic optimization approach for keyword targeting in sponsored search advertising, effectively handling incomplete data and outperforming baselines in profit maximization.
Contribution
It introduces a data distribution estimation model and a stochastic keyword targeting model with a branch-and-bound algorithm, advancing keyword management strategies in SSA.
Findings
BB-KSM outperforms seven baselines in profit.
Superiority increases with larger budgets and more keywords.
Data estimation improves keyword targeting performance.
Abstract
In sponsored search advertising (SSA), advertisers need to select keywords and determine matching types for selected keywords simultaneously, i.e., keyword targeting. An optimal keyword targeting strategy guarantees reaching the right population effectively. This paper aims to address the keyword targeting problem, which is a challenging task because of the incomplete information of historical advertising performance indices and the high uncertainty in SSA environments. First, we construct a data distribution estimation model and apply a Markov Chain Monte Carlo method to make inference about unobserved indices (i.e., impression and click-through rate) over three keyword matching types (i.e., broad, phrase and exact). Second, we formulate a stochastic keyword targeting model (BB-KSM) combining operations of keyword selection and keyword matching to maximize the expected profit under the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
