Improved Differentially Private Algorithms for Rank Aggregation
By: Quentin Hillebrand , Pasin Manurangsi , Vorapong Suppakitpaisarn and more
Potential Business Impact:
Makes online voting fairer and more private.
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.
Similar Papers
Efficient Dynamic Rank Aggregation
Data Structures and Algorithms
Combines many lists into one fast, good list.
Optimal Differentially Private Ranking from Pairwise Comparisons
Statistics Theory
Keeps your private choices secret when ranking things.
Improved Rank Aggregation under Fairness Constraint
Data Structures and Algorithms
Makes sure everyone gets a fair chance in rankings.