{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:57Z","timestamp":1750220697311,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,2,9]],"date-time":"2020-02-09T00:00:00Z","timestamp":1581206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science and Technology, R.O.C.","award":["106-2218-E-002-014-MY, 107-2218-E-002-010, 107-2221-E-006-165-MY2, and 108-2321-B-006-008"],"award-info":[{"award-number":["106-2218-E-002-014-MY, 107-2218-E-002-010, 107-2221-E-006-165-MY2, and 108-2321-B-006-008"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,4,30]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3375393","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T06:49:13Z","timestamp":1581317353000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Budget-Constrained Real-Time Bidding Optimization"],"prefix":"10.1145","volume":"14","author":[{"given":"Chi-Chun","family":"Lin","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3914-8550","authenticated-orcid":false,"given":"Kun-Ta","family":"Chuang","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Taipei, Taiwan"}]},{"given":"Wush Chi-Hsuan","family":"Wu","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2020,2,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623366"},{"volume-title":"Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence.","year":"2012","author":"Amin Kareem","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020454"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"volume-title":"Retrieved","year":"2019","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","first-page":"1","article-title":"ROC graphs: Notes and practical considerations for researchers","volume":"31","author":"Fawcett Tom","year":"2004","journal-title":"Machine Learning"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526744"},{"key":"e_1_2_1_8_1","unstructured":"Google. 2011. The arrival of real-time bidding and what it means for media buyers. Technical report. White Paper.  Google. 2011. The arrival of real-time bidding and what it means for media buyers. Technical report. White Paper."},{"volume-title":"Retrieved","year":"2019","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120220"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJEB.2008.018068"},{"volume-title":"Knapsack Problems","author":"Kellerer Hans","key":"e_1_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501979"},{"volume-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 768--776","year":"2012","author":"Orten Burkay","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06608-0_37"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648590"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983656"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052616"},{"volume-title":"Retrieved","year":"2019","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488200"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339655"},{"volume-title":"Flannery","year":"2007","author":"Press William H.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2668108"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2775228"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983347"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124333"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800220110"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210062"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2697041"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3164742"},{"volume-title":"Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1305--1314","year":"2015","author":"Chi-Hsuan Wu Wush","key":"e_1_2_1_32_1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70096-0_86"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788615"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501980"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SOLI.2014.6960761"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835843"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"volume-title":"Real-time bidding benchmarking with iPinYou dataset. arXiv preprint arXiv:1407.7073","year":"2014","author":"Zhang Weinan","key":"e_1_2_1_39_1"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939713"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_63"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258095"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:48Z","timestamp":1750199568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375393"}},"subtitle":["Multiple Predictors Make It Better"],"short-title":[],"issued":{"date-parts":[[2020,2,9]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.1145\/3375393"],"URL":"https:\/\/doi.org\/10.1145\/3375393","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2020,2,9]]},"assertion":[{"value":"2017-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}