Abstract
Purpose
– This purpose of this article is to solve the problem of bidding on keywords in newly set-up search engine advertising campaigns. Advertisers setting up search engine advertising campaigns for the first time need to place bids on keywords, but typically lack experience and data to determine ranks that maximize a keyword’s profit (generally referred to as a cold-start problem).
Design/methodology/approach
– The authors suggest that advertisers collect data from the Google Keyword Planner to obtain precise estimates of the percentage increases in prices per click and click-through rates, which are needed to calculate optimal bids (exact approach). Together with the profit contribution per conversion and the conversion rate, the advertiser might then set bids that maximize profit. In case advertisers cannot afford to collect the required data, the authors suggest two proxy approaches and evaluate their performance using the exact approach as a benchmark.
Findings
– The empirical study shows that both proxy approaches perform reasonably well, the easier approach to implement (Proxy 2) sometimes performs even better than the more sophisticated one (Proxy 1). As a consequence, advertisers might just use this very simple proxy when bidding on keywords in newly set-up search engine advertising campaigns.
Originality/value
– This research extends the stream of literature on how to determine optimal bids, which so far focuses on campaigns that are already running and where the required data to calculate bids are already available. This research offers a novel approach of determining bids when advertisers lack the aforementioned information.
Reference21 articles.
1. Abhishek, V.
and
Hosanagar, K.
(2013), “Optimal bidding in multi-item multi-slot sponsored search auctions”,
Operations Research
, Vol. 61 No. 4, pp. 855-873.
2. Abou Nabout, N.
and
Skiera, B.
(2012), “Return on quality improvements in search engine marketing”,
Journal of Interactive Marketing
, Vol. 26 No. 3, pp. 141-154.
3. Abou Nabout, N.
,
Skiera, B.
,
Gerstmeier, E.
and
Stepanchuk, T.
(2014), “Profitability of different bidding heuristics in search engine marketing”, Working Paper, Goethe University Frankfurt.
4. Abou Nabout, N.
,
Skiera, B.
,
Stepanchuk, T.
and
Gerstmeier, E.
(2012), “An analysis of the profitability of fee-based compensation plans for search engine marketing”,
International Journal of Research in Marketing
, Vol. 29 No. 1, pp. 68-80.
5. Broder, A.
(2002), “A taxonomy of web search”,
SIGIR Forum
, Vol. 36 No. 2.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献