← Back to the feed
AI & softwareResearch findings

Proposing Reach Optimization under k-Anonymity in Advertising

Original published 2025.01.09 08:38 KSTAdded to Blackdeck 2026.10.24 23:04 KST

What has changed?

A method to accurately measure reach and optimize ad performance under k-anonymity using probabilistic discounting

Key points

  1. Introduces a method to measure reach accurately under k-anonymity
  2. Demonstrates optimization of ad performance using probabilistic discounting
  3. Performance drops temporarily when privacy is enhanced

Connect it to your work

Probabilistic discounting maintains ad effectiveness while preserving user anonymity

What remains unproven

This research note is based on an abstract; check the original for test conditions and application scope.

Originals used for this note

Links open the original publisher in a new tab.

  1. arxivReach Measurement, Optimization and Frequency Capping In Targeted Online Advertising Under k-Anonymity