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.