Optimal Keywords Grouping in Sponsored Search Advertising under Uncertain Environments
Huiran Li, Yanwu Yang

TL;DR
This paper introduces a stochastic programming model for keyword grouping in sponsored search advertising, accounting for uncertainty in click-through and conversion rates, and demonstrates its effectiveness through real-world data experiments.
Contribution
It presents a novel stochastic optimization approach for keyword grouping that considers advertiser risk and budget constraints, outperforming existing baselines.
Findings
Keyword grouping significantly impacts advertising profitability.
Increasing budget does not always lead to diminishing returns.
Optimal grouping involves complex trade-offs among various factors.
Abstract
In sponsored search advertising, advertisers need to make a series of keyword decisions. Among them, how to group these keywords to form several adgroups within a campaign is a challenging task, due to the highly uncertain environment of search advertising. This paper proposes a stochastic programming model for keywords grouping, taking click-through rate and conversion rate as random variables, with consideration of budget constraints and advertisers' risk-tolerance. A branch-and-bound algorithm is developed to solve our model. Furthermore, we conduct computational experiments to evaluate the effectiveness of our model and solution, with two real-world datasets collected from reports and logs of search advertising campaigns. Experimental results illustrated that our keywords grouping approach outperforms five baselines, and it can approximately approach the optimum in a steady way.…
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.
