Online advertising is a major source of income for many online companies. One common approach is to sell online advertisements via waterfall auctions, where a publisher makes sequential price offers to ad networks. The publisher controls the order and prices of the waterfall and by that aims to maximize his revenue. In this work, we propose a methodology to learn a waterfall strategy from historical data by wisely searching in the space of possible waterfalls and selecting the one leading to the highest revenue. The contribution of this work is twofold; First, we propose a novel method to estimate the valuation distribution of each user with respect to each ad network. Second, we utilize the valuation matrix to score our candidate waterfalls as part of a procedure that iteratively searches in local neighborhoods. Our framework guarantees that the waterfall revenue improves between iterations until converging to a local optimum. Real-world demonstrations are provided to show that the proposed method improves the total revenue of real-world waterfalls compared to manual expert optimization. Finally, the code and the data are available here.
翻译:在线广告是许多在线公司的主要收入来源。 一种常见的做法是通过瀑布拍卖出售网上广告,出版商向广告网络提供连续价格。 出版商控制瀑布的秩序和价格,目的是最大限度地增加收入。 在这项工作中,我们提出一种方法,从历史数据中学习瀑布战略,在可能的瀑布空间进行明智的搜索,并选择导致最高收入的方法。 这项工作的贡献是双重的; 首先,我们提出一种新的方法来估计每个用户对每个广告网络的估值分布情况。 其次,我们利用估值矩阵来计算我们候选人的瀑布,作为在当地社区反复搜索的程序的一部分。 我们的框架保证,瀑布收入在与地方最佳对比之前,会改善相互之间的重复。 提供现实世界示范,以表明拟议方法比人工专家优化提高了真实世界瀑布的总收入。 最后,这里可以提供代码和数据。