Tackling Cannibalization Problems for Online Advertisement

Yutaro Ueoka, K. Tsubouchi, Nobuyuki Shimizu
{"title":"Tackling Cannibalization Problems for Online Advertisement","authors":"Yutaro Ueoka, K. Tsubouchi, Nobuyuki Shimizu","doi":"10.1145/3340631.3394875","DOIUrl":null,"url":null,"abstract":"Market cannibalization is inevitable when there are two or more competing marketing approaches to the same customer base. The cannibalization problem has been discussed in the context of search advertising of individual advertisers, whereas in this paper we discuss the problem that advertising platform companies face in dealing with multiple advertisers. In online advertising, they must properly serve ads with varying mass appeal to users with various interests. For them, it is important to maximize the value of the ads for advertisers and also for the platform. To do so, they deploy user models to serve ads. However, shortsighted models could lead to a decrease in overall performance in an attempt to improve certain ads' performance while slightly impairing the rest. We consider this phenomenon from the perspective of cannibalization and confirm the existence of a cannibalization problem in optimizing the delivery of ads in minor categories. To resolve this problem, we propose new methods, apply them to an ad delivery system, and conduct an A/B test. Our methods overcame the cannibalization problem and increased revenue by + 0.6% compared with the baseline method.","PeriodicalId":417607,"journal":{"name":"Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3340631.3394875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Market cannibalization is inevitable when there are two or more competing marketing approaches to the same customer base. The cannibalization problem has been discussed in the context of search advertising of individual advertisers, whereas in this paper we discuss the problem that advertising platform companies face in dealing with multiple advertisers. In online advertising, they must properly serve ads with varying mass appeal to users with various interests. For them, it is important to maximize the value of the ads for advertisers and also for the platform. To do so, they deploy user models to serve ads. However, shortsighted models could lead to a decrease in overall performance in an attempt to improve certain ads' performance while slightly impairing the rest. We consider this phenomenon from the perspective of cannibalization and confirm the existence of a cannibalization problem in optimizing the delivery of ads in minor categories. To resolve this problem, we propose new methods, apply them to an ad delivery system, and conduct an A/B test. Our methods overcame the cannibalization problem and increased revenue by + 0.6% compared with the baseline method.
解决网络广告的同类相食问题
当针对同一客户群存在两种或两种以上相互竞争的营销方法时,市场蚕食是不可避免的。本文讨论的是广告平台公司在与多个广告客户打交道时所面临的问题。在网络广告中,他们必须为不同兴趣的用户提供不同大众吸引力的广告。对他们来说,最大限度地提高广告对广告商和平台的价值是很重要的。为了做到这一点,他们部署了用户模型来投放广告。然而,短视的模型可能会导致整体性能下降,试图提高某些广告的性能,同时略微损害其他广告的性能。我们从同类相食的角度来考虑这一现象,并确认在优化小品类广告投放时存在同类相食的问题。为了解决这个问题,我们提出了新的方法,将其应用于广告投放系统,并进行A/B测试。我们的方法克服了同类相食的问题,与基线方法相比,收益增加了+ 0.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信