First optimal algorithm for fair top-k aggregation and 2-approximation for fair full rank aggregation under Spearman footrule (L1 distance).
Journal of the ACM (JACM) , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A grid-sketching technique enables ε-accurate estimation of W₂² between α-Hölder smooth distributions on (0,1)^d in time ε^{-max(2, (d+1+o(1))/(1+α))}.
citing papers explorer
-
Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
First optimal algorithm for fair top-k aggregation and 2-approximation for fair full rank aggregation under Spearman footrule (L1 distance).
-
Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
A grid-sketching technique enables ε-accurate estimation of W₂² between α-Hölder smooth distributions on (0,1)^d in time ε^{-max(2, (d+1+o(1))/(1+α))}.