Score: 0

Improved Differentially Private Algorithms for Rank Aggregation

Published: November 14, 2025 | arXiv ID: 2511.11319v1

By: Quentin Hillebrand , Pasin Manurangsi , Vorapong Suppakitpaisarn and more

Potential Business Impact:

Makes online voting fairer and more private.

Business Areas:
A/B Testing Data and Analytics

Rank aggregation is a task of combining the rankings of items from multiple users into a single ranking that best represents the users' rankings. Alabi et al. (AAAI'22) presents differentially-private (DP) polynomial-time approximation schemes (PTASes) and $5$-approximation algorithms with certain additive errors for the Kemeny rank aggregation problem in both central and local models. In this paper, we present improved DP PTASes with smaller additive error in the central model. Furthermore, we are first to study the footrule rank aggregation problem under DP. We give a near-optimal algorithm for this problem; as a corollary, this leads to 2-approximation algorithms with the same additive error as the $5$-approximation algorithms of Alabi et al. for the Kemeny rank aggregation problem in both central and local models.

Page Count
16 pages

Category
Computer Science:
Data Structures and Algorithms