基于时间序列预测的在线实时竞价市场上出版商的保留价优化

IF 0.4 Q4 MANAGEMENT
Andrzej Wodecki
{"title":"基于时间序列预测的在线实时竞价市场上出版商的保留价优化","authors":"Andrzej Wodecki","doi":"10.2478/fman-2020-0013","DOIUrl":null,"url":null,"abstract":"Abstract Today's Internet marketing ecosystems are very complex, with many competing players, transactions concluded within milliseconds, and hundreds of different parameters to be analyzed in the decision-making process. In addition, both sellers and buyers operate under uncertainty, without full information about auction results, purchasing preferences, and strategies of their competitors or suppliers. As a result, most market participants strive to optimize their trading strategies using advanced machine learning algorithms. In this publication, we propose a new approach to determining reserve-price strategies for publishers, focusing not only on the profits from individual ad impressions, but also on maximum coverage of advertising space. This strategy combines the heuristics developed by experienced RTB consultants with machine learning forecasting algorithms like ARIMA, SARIMA, Exponential Smoothing, and Facebook Prophet. The paper analyses the effectiveness of these algorithms, recommends the best one, and presents its implementation in real environment. As such, its results may form a basis for a competitive advantage for publishers on very demanding online advertising markets.","PeriodicalId":43250,"journal":{"name":"Foundations of Management","volume":"12 1","pages":"167 - 180"},"PeriodicalIF":0.4000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Reserve Price Optimization for Publishers on Real-Time Bidding on-Line Marketplaces with Time-Series Forecasting\",\"authors\":\"Andrzej Wodecki\",\"doi\":\"10.2478/fman-2020-0013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Today's Internet marketing ecosystems are very complex, with many competing players, transactions concluded within milliseconds, and hundreds of different parameters to be analyzed in the decision-making process. In addition, both sellers and buyers operate under uncertainty, without full information about auction results, purchasing preferences, and strategies of their competitors or suppliers. As a result, most market participants strive to optimize their trading strategies using advanced machine learning algorithms. In this publication, we propose a new approach to determining reserve-price strategies for publishers, focusing not only on the profits from individual ad impressions, but also on maximum coverage of advertising space. This strategy combines the heuristics developed by experienced RTB consultants with machine learning forecasting algorithms like ARIMA, SARIMA, Exponential Smoothing, and Facebook Prophet. The paper analyses the effectiveness of these algorithms, recommends the best one, and presents its implementation in real environment. As such, its results may form a basis for a competitive advantage for publishers on very demanding online advertising markets.\",\"PeriodicalId\":43250,\"journal\":{\"name\":\"Foundations of Management\",\"volume\":\"12 1\",\"pages\":\"167 - 180\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Foundations of Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/fman-2020-0013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/fman-2020-0013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 1

摘要

摘要当今的互联网营销生态系统非常复杂,有许多竞争对手,交易在几毫秒内完成,决策过程中需要分析数百个不同的参数。此外,卖家和买家都在不确定性下运作,没有关于拍卖结果、购买偏好以及竞争对手或供应商策略的完整信息。因此,大多数市场参与者都努力使用先进的机器学习算法来优化他们的交易策略。在本出版物中,我们提出了一种确定出版商保留价格策略的新方法,不仅关注个人广告印象的利润,还关注广告空间的最大覆盖率。该策略将经验丰富的RTB顾问开发的启发式算法与ARIMA、SARIMA、Exponential Smoothing和Facebook Prophet等机器学习预测算法相结合。本文分析了这些算法的有效性,推荐了最佳算法,并介绍了其在实际环境中的实现。因此,它的结果可能会为出版商在要求苛刻的在线广告市场上形成竞争优势奠定基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Reserve Price Optimization for Publishers on Real-Time Bidding on-Line Marketplaces with Time-Series Forecasting
Abstract Today's Internet marketing ecosystems are very complex, with many competing players, transactions concluded within milliseconds, and hundreds of different parameters to be analyzed in the decision-making process. In addition, both sellers and buyers operate under uncertainty, without full information about auction results, purchasing preferences, and strategies of their competitors or suppliers. As a result, most market participants strive to optimize their trading strategies using advanced machine learning algorithms. In this publication, we propose a new approach to determining reserve-price strategies for publishers, focusing not only on the profits from individual ad impressions, but also on maximum coverage of advertising space. This strategy combines the heuristics developed by experienced RTB consultants with machine learning forecasting algorithms like ARIMA, SARIMA, Exponential Smoothing, and Facebook Prophet. The paper analyses the effectiveness of these algorithms, recommends the best one, and presents its implementation in real environment. As such, its results may form a basis for a competitive advantage for publishers on very demanding online advertising markets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
5
审稿时长
12 weeks
×
引用
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学术官方微信