Efficient and Practical Approximation Algorithms for Advertising in Content Feeds

TL;DR

This paper introduces efficient approximation algorithms for optimizing ad placement in content feeds, balancing user engagement and experience, with proven theoretical guarantees and strong empirical results.

Contribution

It presents the first practical 2-approximation greedy algorithms for ad placement, improving over previous methods with a novel focus on bottom items.

Findings

Algorithms achieve a 2-approximation factor.

Empirical results show strong performance of the algorithms.

The approach balances ad effectiveness with user attention decay.

Abstract

Content feeds provided by platforms such as X (formerly Twitter) and TikTok are consumed by users on a daily basis. In this paper, we revisit the native advertising problem in content feeds, initiated by Ieong et al. Given a sequence of organic items (e.g., videos or posts) relevant to a user's interests or to an information search, the goal is to place ads within the organic content so as to maximize a reward function (e.g., number of clicks), while accounting for two considerations: (1) an ad can only be inserted after a relevant content item; (2) the users' attention decays after consuming content or ads. These considerations provide a natural model for capturing both the advertisement effectiveness and the user experience. In this paper, we design fast and practical 2-approximation greedy algorithms for the associated optimization problem, improving over the best-known practical algorithm that only achieves an approximation factor of~4. Our algorithms exploit a counter-intuitive observation, namely, while top items are seemingly more important due to the decaying attention of the user, taking good care of the bottom items is key for obtaining improved approximation guarantees. We then provide the first comprehensive empirical evaluation on the problem, showing the strong empirical performance of our~methods.