@inproceedings{63f5609d7b0b44208ba1a854bbc0cb72,
title = "Using Predicted Weights for Ad Delivery",
abstract = "We study the performance of a proportional weights algorithm for online capacitated bipartite matching modeling the delivery of impression ads. The algorithm uses predictions on the advertiser nodes to match arriving impression nodes fractionally in proportion to the weights of its neighbors. This paper gives a thorough empirical study of the performance of the algorithm on a data-set of ad impressions from Yahoo! and shows its superior performance compared to natural baselines such as a greedy water-filling algorithm and the ranking algorithm. The proportional weights algorithm has recently received interest in the theoretical literature where it was shown to have strong guarantees beyond the worst-case model of algorithms augmented with predictions. We extend these results to the case where the advertisers{\textquoteright} capacities are no longer stationary over time. Additionally, we show the algorithm has near optimal performance in the random-order arrival model when the number of impressions and the optimal matching are sufficiently large.",
author = "Thomas Lavastida and Benjamin Moseley and R. Ravi and Chenyang Xu",
note = "Publisher Copyright: {\textcopyright} 2021 by SIAM.; 1st SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021 ; Conference date: 19-07-2021 Through 21-07-2021",
year = "2021",
language = "英语",
series = "SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021",
publisher = "Society for Industrial and Applied Mathematics Publications",
pages = "21--31",
editor = "Bender, \{Michael A.\} and Gilbert, \{John R.\} and Bruce Hendrickson and Blair, \{Sullivan D.\}",
booktitle = "SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021",
address = "美国",
}