Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to display in tens of milliseconds. Common pricing methods include cost per mille (CPM) and cost per click (CPC). Traditional advertising systems target certain traits of users and ad placements with fixed bids, essentially regarded as coarse-grained matching of bid and traffic quality. However, the fixed bids set by the advertisers competing for different quality requests cannot fully optimize the advertisers' key requirements. Moreover, the platform has to be responsible for the business revenue and user experience. Thus, we proposed a bid optimizing strategy called optimized cost per click (OCPC) which automatically adjusts the bid to achieve finer matching of bid and traffic quality of page view (PV) request granularity. Our approach optimizes advertisers' demands, platform business revenue and user experience and as a whole improves traffic allocation efficiency. We have validated our approach in Taobao display advertising system in production. The online A/B test shows our algorithm yields substantially better results than previous fixed bid manner.
Stochastic Budget Optimization in Internet Advertising
互联网广告是一个复杂的游戏,许多广告商“玩”,以优化他们的投资回报。广告有许多“目标”,每个“目标”都有一组游戏,其中涉及的玩家可能不同。在本文中,我们研究的问题,广告客户如何分配他们的预算在这些“目标”。特别是,我们专注于制定他们的最佳对策作为一个优化问题。广告商有一组关键词(“目标”)和一些关于未来的随机信息,即成本与点击组合场景的概率分布。这总结了假设其他参与者的策略是固定的世界的潜在状态。然后,最佳响应可以抽象为随机预算优化问题,以找出如何在这些关键字之间分配给定的预算,以最大化预期的点击次数。我们提出了第一个已知的非平凡的多对数近似这些问题,以及第一个已知的硬度的结果得到更好的对数近似比在所涉及的各种参数。我们还确定了几个特殊的情况下,这些问题的实际利益,如固定数量的情况下,或与成本相关的多项式大小的参数,这是可解决的多项式时间或改进的近似比。情景随机预算优化具有复杂的技术结构。我们的近似和硬度的结果来自于这些问题的一种特殊类型的(0/1,二分)二次程序中固有的。我们的研究回答了作者在(Stochastic Models for Budget Optimization in Search-Based Advertising,Quartermica,58(4),1022-1044,2010)中提出的一些开放性问题。
HiBid: A Cross-Channel Constrained Bidding System with Budget Allocation by Hierarchical Offline Deep Reinforcement Learning
School of Computer Science and Technology, Beijing Institute of Technology(北京理工大学计算机科学与技术学院);Meituan(美团);Institute for Advanced Algorithms Research(先进算法研究院)