Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders
ACM Transactions on Economics and Computation · 15.06.2016 · 4 (3) · 1-20
DOI: 10.1145/2892563 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Economics and Computation, online erschienen am 06.04.2016. Verfasst von Nikhil R. Devanur und 4 weiteren Autor:innen. Die Arbeit wurde bisher 30-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: Simons Graduate Fellowship for Theoretical Computer Science.
Abstract (Originalsprache)
In the context of online ad serving, display ads may appear on different types of web pages , where each page includes several ad slots and therefore multiple ads can be shown on each page. The set of ads that can be assigned to ad slots of the same page needs to satisfy various prespecified constraints including exclusion constraints, diversity constraints, and the like. Upon arrival of a user, the ad serving system needs to allocate a set of ads to the current webpage respecting these per-page allocation constraints. Previous slot-based settings ignore the important concept of a page and may lead to highly suboptimal results in general. In this article, motivated by these applications in display advertising and inspired by the submodular welfare maximization problem with online bidders, we study a general class of page-based ad allocation problems, present the first (tight) constant-factor approximation algorithms for these problems, and confirm the performance of our algorithms experimentally on real-world datasets. A key technical ingredient of our results is a novel primal-dual analysis for handling free disposal, which updates dual variables using a “level function” instead of a single level and unifies with previous analyses of related problems. This new analysis method allows us to handle arbitrarily complicated allocation constraints for each page. Our main result is an algorithm that achieves a 1 - 1 / e - o (1)-competitive ratio. Moreover, our experiments on real-world datasets show significant improvements of our page-based algorithms compared to the slot-based algorithms. Finally, we observe that our problem is closely related to the submodular welfare maximization (SWM) problem. In particular, we introduce a variant of the SWM problem with online bidders and show how to solve this problem using our algorithm for whole-page optimization.
Förderung
- Simons Graduate Fellowship for Theoretical Computer Science
Zitieren
APA
Devanur, N. R., Huang, Z., Korula, N., Mirrokni, V. S., & Yan, Q. (2016). Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Transactions on Economics and Computation, 4(3), 1-20. https://doi.org/10.1145/2892563
Vancouver
Devanur NR, Huang Z, Korula N, Mirrokni VS, Yan Q. Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Transactions on Economics and Computation. 2016;4(3):1-20. doi:10.1145/2892563
BibTeX
@article{Devanur2016,
author = {Devanur, Nikhil R. and Huang, Zhiyi and Korula, Nitish and Mirrokni, Vahab S. and Yan, Qiqi},
title = {Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders},
journal = {ACM Transactions on Economics and Computation},
year = {2016},
volume = {4},
number = {3},
pages = {1--20},
doi = {10.1145/2892563}
}
EUVIMED