kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
Shenzhen Technology University Shenzhen, China.
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS. KTH Royal Institute of Technology Stockholm, Sweden.ORCID iD: 0009-0007-5894-0774
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS.ORCID iD: 0000-0002-5211-112X
2025 (English)In: WWW 2025 - Proceedings of the ACM Web Conference, Association for Computing Machinery (ACM) , 2025, p. 3193-3203Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM) , 2025. p. 3193-3203
Keywords [en]
Ad Allocation, Approximation Algorithms, Externalities, Matching, Newsfeed Advertising
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-363994DOI: 10.1145/3696410.3714902ISI: 001505285200265Scopus ID: 2-s2.0-105005143402OAI: oai:DiVA.org:kth-363994DiVA, id: diva2:1962830
Conference
34th ACM Web Conference, WWW 2025, Sydney, Australia, Apr 28 2025 - May 2 2025
Note

Part of ISBN 9798400712746

QC 20250603

Available from: 2025-06-02 Created: 2025-06-02 Last updated: 2025-12-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Sarpe, IlieGionis, Aristides

Search in DiVA

By author/editor
Sarpe, IlieGionis, Aristides
By organisation
Theoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 102 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf