The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Optimal real-time bidding for display advertising
Open accessAbstract
In this paper we study bid optimisation for real-time bidding (RTB) based display advertising. RTB allows advertisers to bid on a display ad impression in real time when it is being generated. It goes beyond contextual advertising by motivating the bidding focused on user data and it is different from the sponsored search auction where the bid price is associated with keywords. For the demand side, a fundamental technical challenge is to automate the bidding process based on the budget, the campaign objective and various information gathered in runtime and in history. In this paper, the programmatic bidding is cast as a functional optimisation problem. Under certain dependency assumptions, we derive simple bidding functions that can be calculated in real time; our finding shows that the optimal bid has a non-linear relationship with the impression level evaluation such as the click-through rate and the conversion rate, which are estimated in real time from the impression level features. This is different from previous work that is mainly focused on a linear bidding function. Our mathematical derivation suggests that optimal bidding strategies should try to bid more impressions rather than focus on a small set of high valued impressions because according to the current RTB market data, compared to the higher evaluated impressions, the lower evaluated ones are more cost effective and the chances of winning them are relatively higher. Aside from the theoretical insights, offline experiments on a real dataset and online experiments on a production RTB system verify the effectiveness of our proposed optimal bidding strategies and the functional optimisation framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mcgill, R., Tukey, J. W., & Larsen, W. A. (1978) · The American Statistician · doi:10.1080/00031305.1978.10479236 · Cited by 2,490
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
One-Class Collaborative Filtering
Pan, R., Zhou, Y., Cao, B., Liu, N. N., Lukose, R., Scholz, M., & Yang, Q. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.16 · Cited by 1,015
An experimental comparison of click position-bias models
Craswell, N., Zoeter, O., Taylor, M., & Ramsey, B. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341545 · Cited by 942
(2010) · Cited by 444
Ostrovsky, M., Schwarz, M., & Edelman, B. G. (2005) · SSRN Electronic Journal · doi:10.2139/ssrn.861164 · Cited by 333
A semantic approach to contextual advertising
Broder, A., Fontoura, M., Josifovski, V., & Riedel, L. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277837 · Cited by 328
Optimizing top-n collaborative filtering via dynamic negative item sampling
Zhang, W., Chen, T., Wang, J., & Yu, Y. (2013) · Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2484028.2484126 · Cited by 256
Self-citationReal-time bidding for online advertising: measurement and analysis
Yuan, S., Wang, J., & Zhao, X. (2013) · Proceedings of the Seventh International Workshop on Data Mining for Online Advertising · doi:10.1145/2501040.2501980 · Cited by 217
Self-citationEstimating conversion rate in display advertising from past erformance data
Lee, K.-C., Orten, B., Dasdan, A., & Li, W. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339651 · Cited by 197
Muthukrishnan, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10841-9_1 · Cited by 191
Budget optimization in search-based advertising auctions
Feldman, J., Muthukrishnan, S., Pál, M., & Stein, C. (2007) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1250910.1250917 · Cited by 172
Bid optimizing and inventory scoring in targeted online advertising
Perlich, C., Dalessandro, B., Hook, R., Stitelman, O., Raeder, T., & Provost, F. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339655 · Cited by 160
Real time bid optimization with smooth budget delivery in online advertising
Lee, K.-C., Jalali, A., & Dasdan, A. (2013) · doi:10.1145/2501040.2501979 · Cited by 146
Optimal Bidding on Keyword Auctions
Kitts, B. J., & LeBlanc, B. J. (2004) · Electronic Markets · doi:10.1080/1019678042000245119 · Cited by 134
Selling off Privacy at Auction
Olejnik, Ł., Minh-Dung, T., & Castelluccia, C. (2014) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23270 · Cited by 128
Bid landscape forecasting in online ad exchange marketplace
Cui, Y. D., Zhang, R., Li, W., & Mao, J. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020454 · Cited by 125
Edelman, B., Ostrovsky, M., & Schwarz, M. H. (2005) · National Bureau of Economic Research · doi:10.3386/w11765 · Cited by 114
Optimizing relevance and revenue in ad search
Radlinski, F., Broder, A., Ciccolo, P., Gabrilovich, E., Josifovski, V., & Riedel, L. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390404 · Cited by 96
Real-Time Bidding: A New Frontier of Computational Advertising Research
Wang, J., & Yuan, S. (2015) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2684822.2697041 · Cited by 77
Self-citationAdaptive bidding for display advertising
Ghosh, A., Rubinstein, B. I. P., Vassilvitskii, S., & Zinkevich, M. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526744 · Cited by 75
An empirical study of reserve price optimisation in real-time bidding
Yuan, S., Wang, Y.-X., Chen, B., Mason, P., & Seljan, S. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623357 · Cited by 73
Self-citationEvaluating and Optimizing Online Advertising: Forget the Click, but There Are Good Proxies
Dalessandro, B., Hook, R., Perlich, C., & Provost, F. J. (2015) · Big Data · doi:10.1089/big.2015.0006 · Cited by 44
Sequential selection of correlated ads by POMDPs
Yuan, S., & Wang, J. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396828 · Cited by 43
Self-citationOptimizing search engine revenue in sponsored search
Zhu, Y., Wang, G. A., Yang, J., Wang, D., Yan, J., Hu, J., & Chen, Z. (2009) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1571941.1572042 · Cited by 42
Behavioural Targeting in On-Line Advertising: An Empirical Study
Jaworska, J., & Marcin Sydow, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85481-4_7 · Cited by 39
Bid keyword suggestion in sponsored search based on competitiveness and relevance
Zhang, Y., Zhang, W., Gao, B., Yuan, X., & Liu, T. (2014) · Information Processing & Management · doi:10.1016/j.ipm.2014.02.004 · Cited by 38
Self-citationBid generation for advanced match in sponsored search
Broder, A., Gabrilovich, E., Josifovski, V., Mavromatis, G., & Smola, A. J. (2011) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1935826.1935901 · Cited by 20
Cited by
Product-Based Neural Networks for User Response Prediction
Qu, Y., Cai, H., Ren, K., Zhang, W., Yu, Y., Wen, Y., & Wang, J. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0151 · Cited by 670
Self-citationDeep Learning over Multi-field Categorical Data
Zhang, W., Du, T., & Wang, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-30671-1_4 · Cited by 445
Self-citationOnline Display Advertising Markets: A Literature Review and Future Directions
Choi, H., Mela, C. F., Balseiro, S. R., & Leary, A. (2020) · Information Systems Research · doi:10.1287/isre.2019.0902 · Cited by 181
Turning Clicks into Purchases: Revenue Optimization for Product Search in E-Commerce
Wu, L., Hu, D., Hong, L., & Liu, H. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209993 · Cited by 85
Metadata
- Authors
- Zhang, W., Yuan, S., & Wang, J.
- Venue
- Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2014-08-24
- Pages
- 1077-1086
- OpenAlex
- W2149822245
- Cited by
- 305
- References
- 28
- FWCI
- 41.06
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.