File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Whole-page optimization and submodular welfare maximization with online bidders
Title | Whole-page optimization and submodular welfare maximization with online bidders |
---|---|
Authors | |
Keywords | Display Ads Free Disposal Primal Dual |
Issue Date | 2013 |
Citation | Proceedings Of The Acm Conference On Electronic Commerce, 2013, p. 305-322 How to Cite? |
Abstract | 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 pre-specified 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 web-page 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 paper, 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 data sets. 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 analy- ses 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 data sets 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. Copyright © 2013 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/188509 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Devanur, NR | en_US |
dc.contributor.author | Huang, Z | en_US |
dc.contributor.author | Korula, N | en_US |
dc.contributor.author | Mirrokni, VS | en_US |
dc.contributor.author | Yan, Q | en_US |
dc.date.accessioned | 2013-09-03T04:08:47Z | - |
dc.date.available | 2013-09-03T04:08:47Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.citation | Proceedings Of The Acm Conference On Electronic Commerce, 2013, p. 305-322 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/188509 | - |
dc.description.abstract | 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 pre-specified 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 web-page 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 paper, 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 data sets. 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 analy- ses 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 data sets 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. Copyright © 2013 ACM. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Proceedings of the ACM Conference on Electronic Commerce | en_US |
dc.subject | Display Ads | en_US |
dc.subject | Free Disposal | en_US |
dc.subject | Primal Dual | en_US |
dc.title | Whole-page optimization and submodular welfare maximization with online bidders | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Huang, Z: hzhiyi@cis.upenn.edu | en_US |
dc.identifier.authority | Huang, Z=rp01804 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-84879759052 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84879759052&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.spage | 305 | en_US |
dc.identifier.epage | 322 | en_US |
dc.identifier.scopusauthorid | Devanur, NR=6603235811 | en_US |
dc.identifier.scopusauthorid | Huang, Z=55494568500 | en_US |
dc.identifier.scopusauthorid | Korula, N=26021945000 | en_US |
dc.identifier.scopusauthorid | Mirrokni, VS=6602331710 | en_US |
dc.identifier.scopusauthorid | Yan, Q=55782626700 | en_US |