Optimal Keywords Grouping in Sponsored Search Advertising under Uncertain Environments

• URL: http://arxiv.org/abs/2203.02192v1
• Date: Fri, 4 Mar 2022 08:54:50 GMT
• Title: Optimal Keywords Grouping in Sponsored Search Advertising under Uncertain Environments
• Authors: Huiran Li, Yanwu Yang
• Abstract summary: This paper proposes a programming model for keywords grouping. It takes click-through rate and conversion rate as random variables. A branch-and-bound algorithm is developed to solve our model.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• 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. This research generates several interesting findings that illuminate critical managerial insights for advertisers in sponsored search advertising. First, keywords grouping does matter for advertisers, especially in the situation with a large number of keywords. Second, in keyword grouping decisions, the marginal profit does not necessarily show the marginal diminishing phenomenon as the budget increases. Such that, it's a worthy try for advertisers to increase their budget in keywords grouping decisions, in order to obtain additional profit. Third, the optimal keywords grouping solution is a result of multifaceted trade-off among various advertising factors. In particular, assigning more keywords into adgroups or having more budget won't certainly lead to higher profits. This suggests a warning for advertisers that it's not wise to take the number of keywords as the criterion for keywords grouping decisions.

Related papers

• Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
  We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
  arXiv  Detail & Related papers  (2024-05-31T19:26:05Z)
• Keyword Decisions in Sponsored Search Advertising: A Literature Review and Research Agenda [0.0]
  Keywords serve as the basic unit of business model, linking three stakeholders: consumers, advertisers and search engines. This paper presents an overarching framework for keyword decisions that highlights the touchpoints in search advertising management. Using this framework, we review the state-of-the-art research literature on keyword decisions with respect to techniques, input features and evaluation metrics.
  arXiv  Detail & Related papers  (2023-02-24T00:24:17Z)
• Keyword Targeting Optimization in Sponsored Search Advertising: Combining Selection and Matching [0.0]
  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. Experimental results show that, (a) BB-KSM outperforms seven baselines in terms of profit; (b) BB-KSM shows its superiority as the budget increases.
  arXiv  Detail & Related papers  (2022-10-19T03:37:32Z)
• Persuasion Strategies in Advertisements [68.70313043201882]
  We introduce an extensive vocabulary of persuasion strategies and build the first ad image corpus annotated with persuasion strategies. We then formulate the task of persuasion strategy prediction with multi-modal learning. We conduct a real-world case study on 1600 advertising campaigns of 30 Fortune-500 companies.
  arXiv  Detail & Related papers  (2022-08-20T07:33:13Z)
• Aggregate effects of advertising decisions: a complex systems look at search engine advertising via an experimental study [26.218512292529635]
  We develop and validate a simulation framework that supports assessments of various advertising strategies and estimations of the impact of mechanisms on the search market. We conduct three experiments on the aggregate impact of electronic word-of-mouth, the competition level, and strategic bidding behaviors.
  arXiv  Detail & Related papers  (2022-03-04T09:16:15Z)
• Keyword Optimization in Sponsored Search Advertising: A Multi-Level Computational Framework [20.22050119811848]
  Keywords serve as an essential bridge linking advertisers, search users and search engines. This paper proposes a multi-level and closed-form computational framework for keyword optimization.
  arXiv  Detail & Related papers  (2022-02-28T02:03:14Z)
• Diversity driven Query Rewriting in Search Advertising [1.5289756643078838]
  generative retrieval models have been shown to be effective at the task of generating such query rewrites. We introduce CLOVER, a framework to generate both high-quality and diverse rewrites. We empirically show the effectiveness of our proposed approach through offline experiments on search queries across geographies spanning three major languages.
  arXiv  Detail & Related papers  (2021-06-07T17:30:45Z)
• Learning to Infer User Hidden States for Online Sequential Advertising [52.169666997331724]
  We propose our Deep Intents Sequential Advertising (DISA) method to address these issues. The key part of interpretability is to understand a consumer's purchase intent which is, however, unobservable (called hidden states)
  arXiv  Detail & Related papers  (2020-09-03T05:12:26Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• Online Joint Bid/Daily Budget Optimization of Internet Advertising Campaigns [115.96295568115251]
  We study the problem of automating the online joint bid/daily budget optimization of pay-per-click advertising campaigns over multiple channels. For every campaign, we capture the dependency of the number of clicks on the bid and daily budget by Gaussian Processes. We design four algorithms and show that they suffer from a regret that is upper bounded with high probability as O(sqrtT) We present the results of the adoption of our algorithms in a real-world application with a daily average spent of 1,000 Euros for more than one year.
  arXiv  Detail & Related papers  (2020-03-03T11:07:38Z)
• Adversarial Attacks on Linear Contextual Bandits [87.08004581867537]
  Malicious agents may have incentives to attack the bandit algorithm to induce it to perform a desired behavior. We show that a malicious agent can force a linear contextual bandit algorithm to pull any desired arm $T - o(T)$ times over a horizon of $T$ steps. We also investigate the case when a malicious agent is interested in affecting the behavior of the bandit algorithm in a single context.
  arXiv  Detail & Related papers  (2020-02-10T15:04:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.