Budget-constrained real-time bidding optimization: Multiple predictors make it better

Chi Chun Lin, Kun Ta Chuang, Wush Chi-Hsuan Wu, Ming Syan Chen

研究成果: Article同行評審

摘要

In this article, we pursue a better solution for the promising problem, i.e., the bidding strategy design, in the real-time bidding (RTB) advertising (AD) environment. Under the budget constraint, the design of an optimal strategy for bidding on each incoming impression opportunity targets at acquiring as many clicks as possible during an AD campaign. State-of-the-art bidding algorithms rely on a single predictor, the clickthrough rate predictor, to calculate the bidding value for each impression. This provides reasonable performance if the predictor has appropriate accuracy in predicting the probability of user clicking. However, the classical methods usually fail to capture optimal results since the predictor accuracy is limited. We improve the situation by accomplishing an additional winning price predictor in the bidding process. In this article, an algorithm combining powers of multiple prediction models is developed. It emerges from an analogy to the online stochastic knapsack problem, and the efficiency of the algorithm is also theoretically analyzed. Experiments conducted on real world RTB datasets show that the proposed solution performs better with regard to both number of clicks achieved and effective cost per click in many different settings of budget constraints.

原文English
文章編號14
期刊ACM Transactions on Knowledge Discovery from Data
14
發行號2
DOIs
出版狀態Published - 2020 二月

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

指紋 深入研究「Budget-constrained real-time bidding optimization: Multiple predictors make it better」主題。共同形成了獨特的指紋。

引用此