A Decision Support Method to Increase the Revenue of Ad Publishers in Waterfall Strategy

Reza Refaei Afshar, Yingqian Zhang, M. Firat, U. Kaymak
{"title":"A Decision Support Method to Increase the Revenue of Ad Publishers in Waterfall Strategy","authors":"Reza Refaei Afshar, Yingqian Zhang, M. Firat, U. Kaymak","doi":"10.1109/CIFEr.2019.8759106","DOIUrl":null,"url":null,"abstract":"Online advertising is one of the most important sources of income for many online publishers. The process is as easy as placing slots in the website and selling those slots in real time bidding auctions. Since websites load in few milliseconds, the bidding and selling process should not take too much time. Sellers or publishers of advertisements aim to maximize the revenue obtained through online advertising. In this paper, we propose a method to select the most profitable ad network for each ad request that is built upon our previous work [1]. The proposed method consists of two parts: a prediction model and a reinforcement learning modeling. We test two strategies of selecting ad network orderings. The first strategy uses the developed prediction model to greedily choose the network with the highest expected revenue. The second strategy is a two-step approach, where a reinforcement learning method is used to improve the revenue estimation of the prediction model. Using real AD auction data, we show that the ad network ordering obtained from the second strategy returns much higher revenue than the first strategy.","PeriodicalId":368382,"journal":{"name":"2019 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIFEr.2019.8759106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Online advertising is one of the most important sources of income for many online publishers. The process is as easy as placing slots in the website and selling those slots in real time bidding auctions. Since websites load in few milliseconds, the bidding and selling process should not take too much time. Sellers or publishers of advertisements aim to maximize the revenue obtained through online advertising. In this paper, we propose a method to select the most profitable ad network for each ad request that is built upon our previous work [1]. The proposed method consists of two parts: a prediction model and a reinforcement learning modeling. We test two strategies of selecting ad network orderings. The first strategy uses the developed prediction model to greedily choose the network with the highest expected revenue. The second strategy is a two-step approach, where a reinforcement learning method is used to improve the revenue estimation of the prediction model. Using real AD auction data, we show that the ad network ordering obtained from the second strategy returns much higher revenue than the first strategy.
瀑布策略下提高广告发布商收益的决策支持方法
在线广告是许多在线出版商最重要的收入来源之一。这个过程就像在网站上放置插槽并在实时竞价拍卖中出售这些插槽一样简单。由于网站加载在几毫秒内,投标和销售过程不应该花费太多时间。广告的销售者或发布者的目标是通过网络广告获得最大的收益。在本文中,我们提出了一种基于我们之前的工作[1]的方法来为每个广告请求选择最有利可图的广告网络。该方法由两部分组成:预测模型和强化学习建模。我们测试了两种选择广告网络排序的策略。第一种策略是利用建立的预测模型,贪婪地选择期望收益最高的网络。第二种策略是两步法,其中使用强化学习方法来改进预测模型的收益估计。利用真实的广告拍卖数据,我们证明了从第二种策略中获得的广告网络订单比第一种策略获得的收益要高得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信