The Whole-Page Optimization via Dynamic Ad Allocation

12Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern search engines present result pages composed of two most prominent types of information: sponsored and organic search results. The whole-page results must satisfy user's information inquiry while sponsored ad alongside the search results has become a key monetization strategy for the platform. Against the backdrop of this situation, a basic question has received comparatively little attention: how many ads are good enough to get higher user satisfaction and better monetization Most search engines always display a fixed number of ads or use heuristic rules to determine the number of ads. In this paper, we formulate the task of finding the best number of ads into a linear programming optimization problem, for which we propose a novel online algorithm to solve. We have conducted several offline experiments and tested our approach in Alibaba E-commerce platform. The experimental results show that the platform could achieve higher revenue and more clicks simultaneously by the proposed algorithm.

Cite

CITATION STYLE

APA

Zhang, W., Wei, C., Meng, X., Hu, Y., & Wang, H. (2018). The Whole-Page Optimization via Dynamic Ad Allocation. In The Web Conference 2018 - Companion of the World Wide Web Conference, WWW 2018 (pp. 1407–1411). Association for Computing Machinery, Inc. https://doi.org/10.1145/3184558.3191584

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free