pith. sign in

arxiv: 2605.23265 · v1 · pith:XCL4VEH3new · submitted 2026-05-22 · 💻 cs.DS

Fairness in Aggregation: Optimal Top-k and Improved Full Ranking

Diptarka Chakraborty , Arya Mazumdar , Barna Saha , Alvin Hong Yao Yan This is my paper

Pith reviewed 2026-05-25 03:11 UTC · model grok-4.3

classification 💻 cs.DS
keywords rank aggregationfairnesstop-k rankingSpearman footruleapproximation algorithmsgroup representationconsensus ranking
0
0 comments X

The pith

The paper gives the first optimal algorithm for fair top-k rank aggregation and a 2-approximation for fair full rank aggregation under the Spearman footrule distance.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The work focuses on incorporating group fairness into rank aggregation so that different groups appear in the top positions of the output list. For the top-k variant, which matters most in hiring and recommendation settings, the authors supply an exact optimal algorithm. For full rankings over all items they improve the best known guarantee from a 3-approximation to a 2-approximation, narrowing the gap to the unconstrained problem that already admits an exact solution. Experiments on real data sets confirm that the new methods perform well against prior baselines.

Core claim

Under the Spearman footrule distance the authors present the first optimal algorithm for the fair aggregate top-k problem and a 2-approximation algorithm for the fair full rank-aggregation problem, improving on the previous 3-approximation.

What carries the argument

Fairness constraint that forces at least one member from each group into the top-k positions of the aggregate ranking, optimized under the L1 (Spearman footrule) distance between input and output permutations.

If this is right

  • Fair top-k aggregation can be solved exactly rather than approximately.
  • Full fair rank aggregation now admits a 2-approximation instead of 3.
  • The computational gap between fair and unconstrained rank aggregation under footrule distance is reduced.
  • The algorithms can be tested directly on data sets from hiring, search, and recommendation domains.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same fairness model might be combined with other distance measures such as Kendall tau if the 2-approximation technique extends.
  • In practice the top-k result can be used as a drop-in replacement for current unfair aggregators in recommendation pipelines.
  • The improvement from 3 to 2 suggests that further tightening toward a PTAS or exact algorithm for the full case may be possible.
  • Group-balance constraints could be generalized to proportional representation rather than simple presence.

Load-bearing premise

Fairness means that each group must appear at least once inside the top-k slots of the final ranking when distance is measured by Spearman footrule.

What would settle it

An explicit input instance of rankings and group labels for which the claimed optimal top-k algorithm returns a ranking whose footrule cost exceeds the true minimum cost among all fair top-k rankings.

Figures

Figures reproduced from arXiv: 2605.23265 by Alvin Hong Yao Yan, Arya Mazumdar, Barna Saha, Diptarka Chakraborty.

Figure 1
Figure 1. Figure 1: Example of the graph generated by the reduction for the example in the proof of Lemma 4.3. For instance, the cost of placing 3 at rank 4 is equal to 4, as π1(3)<4,π2(3)<4 and π3(3)−4= 2. and τ ={1,2,6}. It is well-known that the problem of finding a minimum cost perfect matching in a complete bipartite graph can be solved in time O(v 3 ) (Edmonds & Karp, 1972) where v is the number of vertices in the graph… view at source ↗
Figure 2
Figure 2. Figure 2: Results on Movielens dataset. Top figure shows varying k, bottom left shows varying n and bottom right shows varying d. 5 10 15 20 25 30 35 40 k 2800 3000 3200 3400 3600 3800 4000 Objective cost Optimal Algorithm 3 BFI KT 10 15 20 25 n 1500 2000 2500 3000 3500 4000 Objective cost 30 35 40 45 50 55 d 1000 1500 2000 2500 3000 3500 Objective cost [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Results on football dataset (week 4). Top figure shows varying k, bottom left shows varying n and bottom right shows varying d. only Algorithm 3 in the figure for readability. As the results across all 16 instances of the football dataset are similar, we only plot results for one instance (week 4) of the dataset. We vary the parameters k, n, and d in the input instances to study the impact on algorithm per… view at source ↗
Figure 4
Figure 4. Figure 4: Results on the Movielens dataset for fair rank aggregation under the Kendall-tau distance. 5 10 15 20 25 30 35 40 k 1700 1800 1900 2000 2100 2200 2300 2400 2500 Objective cost Algorithm 3 KT BFI 10 15 20 25 n 750 1000 1250 1500 1750 2000 2250 2500 Objective cost 30 35 40 45 50 55 d 750 1000 1250 1500 1750 2000 2250 2500 Objective cost [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Results on football dataset for fair rank aggregation under Kendall-tau distance. ranking with an objective cost 5% - 11% less than that found by KT, and 13% - 15% less than BFI. In the football dataset, our algorithm finds a ranking with an objective cost between 1% - 2% less than KT, and 5% - 10% less than BFI. Our algorithm is robust and performs well in all cases as the various parameters are varied. R… view at source ↗
Figure 6
Figure 6. Figure 6: Illustration of the variable gadget in the reduction for a variable xi. Drawn edges are of weight 1, and edges of weight 0 are omitted. Note that the three colors in the reduction are distinct from the colors used for other variables. {w1,···,wk}. The weight of an edge e= (vi ,wj ) for vi ∈V and wj ∈W is set to be - P π∈S |π(i)−j|. The fairness pa￾rameters are exactly the α, ¯ β¯ as in fair rank aggregatio… view at source ↗
Figure 7
Figure 7. Figure 7: Illustration of the clause gadget in the reduction for a clause C8 =x1∨x¯3∨x4. Drawn edges are of weight 1, and edges of weight 0 are omitted. Colors omitted as they are not relevant for the clause gadget. vertex Ci to W. For each variable xj in Ci , suppose this is the r-th appearance of the variable in the formula. If xj appears non-negated, then construct an edge of weight 1 from vertex (x T j , r) to v… view at source ↗
read the original abstract

Ensuring fairness in algorithmic ranking systems is a critical challenge with significant societal implications for hiring, recommendations, web search, and data management. Standard methods for aggregating multiple preference orders into a consensus ranking may perpetuate and even amplify the lack of representation of underrepresented groups. To address this, recent research has focused on incorporating fairness constraints to ensure the presence of different groups in the top-$k$ positions of the final aggregate ranking. We study two fairness-aware variants under the well-known Spearman footrule, which corresponds to the $L_1$ distance between rankings. First, we address the practically salient task of computing a fair aggregate top-$k$ ranking -- crucial in settings like recommendations and hiring where selection is primarily based on the top-$k$ results -- and present the first optimal algorithm for this problem. Second, we consider fair (full) rank aggregation over all candidates (not specifically on top-$k$). We already know of a $3$-approximation for this fair rank aggregation variant (Wei et al., SIGMOD'22; Chakraborty et al., NeurIPS'22), whereas an exact algorithm exists for the corresponding unconstrained (unfair) version (Dwork et al., WWW'01). Closing the computational gap between fair and unconstrained rank aggregation has remained a tantalizing open problem. We make significant progress by giving a $2$-approximation algorithm for fair (full) rank aggregation, improving substantially over the previous $3$-approximation. Further, we complement our theoretical contributions with experiments on different real-world datasets, which corroborate our theoretical results and demonstrate strong empirical performance relative to state-of-the-art baselines.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper claims to present the first optimal algorithm for the fair aggregate top-k ranking problem under the Spearman footrule distance subject to group-presence constraints in the top-k positions. It further claims a 2-approximation algorithm for the fair full rank aggregation problem (improving on the prior 3-approximation), together with experimental results on real-world datasets that corroborate the theoretical guarantees and show strong performance relative to baselines.

Significance. If the optimality and approximation claims hold, the work would constitute a clear advance in fairness-aware rank aggregation: it supplies the first exact algorithm for the practically relevant top-k setting and tightens the approximation ratio for the full-ranking setting while retaining the explicit group-representation fairness model. The experimental component provides useful empirical grounding.

minor comments (3)
  1. [Abstract] The abstract states optimality and approximation results but does not indicate the proof technique (e.g., dynamic programming, LP rounding, or reduction); a one-sentence pointer in the abstract or introduction would help readers locate the central argument.
  2. [Introduction] The description of the group-presence constraints (number of groups, how membership is determined) is referenced but not formalized until later; an early, self-contained definition would improve readability.
  3. [Experiments] Experimental section: the paper reports performance relative to baselines but does not state the precise values of k, number of input rankings, or group sizes used in each dataset; adding these parameters to Table X or the experimental setup paragraph would aid reproducibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our contributions, for recognizing the significance of the first optimal algorithm for fair top-k aggregation and the improved 2-approximation for fair full rank aggregation, and for recommending minor revision. The report contains no major comments to address.

Circularity Check

0 steps flagged

No significant circularity; results are independent algorithmic contributions

full rationale

The paper defines the fair aggregation problems explicitly (group presence constraints under Spearman footrule) and claims new algorithmic results: an optimal algorithm for the top-k variant and a 2-approximation for the full variant. The 3-approximation baseline is cited from prior work (including one self-citation), but the new claims do not reduce to that baseline by construction, nor to any fitted parameters, self-definitions, or imported uniqueness theorems. The derivation chain consists of standard algorithmic design (LP/IP formulations, approximations) with external benchmarks, making the central results self-contained and non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

This is an algorithms paper introducing new methods for existing rank aggregation problems with fairness. No free parameters are fitted to data and no new entities are postulated; relies on standard mathematical assumptions in theoretical computer science and the problem definition from prior work.

axioms (1)
  • domain assumption Rank aggregation can be modeled using the Spearman footrule as the L1 distance between rankings with fairness constraints on group representation in top-k.
    Explicitly stated in the abstract as the distance and fairness model used for the studied variants.

pith-pipeline@v0.9.0 · 5837 in / 1265 out tokens · 60231 ms · 2026-05-25T03:11:44.255241+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

79 extracted references · 79 canonical work pages

  1. [1]

    The American Journal of Psychology , volume=

    The Proof and Measurement of Association between Two Things , author=. The American Journal of Psychology , volume=

    work page

  2. [2]

    British Journal of Psychology , volume=

    Footrule for measuring correlation , author=. British Journal of Psychology , volume=. 1906 , publisher=

    work page 1906

  3. [3]

    Efficient rank aggregation via

    Li, Pan and Mazumdar, Arya and Milenkovic, Olgica , booktitle=. Efficient rank aggregation via. 2017 , organization=

    work page 2017

  4. [4]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Spearman's footrule as a measure of disarray , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 1977 , publisher=

    work page 1977

  5. [5]

    CRISE (Centre for Research on Inequality, Human Security and Ethnicity) Working Paper , volume=

    Affirmative action in South Africa: an empirical assessment of the impact on labour market outcomes , author=. CRISE (Centre for Research on Inequality, Human Security and Ethnicity) Working Paper , volume=

    work page

  6. [6]

    Race and Inequality , pages=

    Affirmative action in South Africa: The limits of history , author=. Race and Inequality , pages=. 2017 , publisher=

    work page 2017

  7. [7]

    Journal of Women, Politics & Policy , volume=

    Gendering representation in Spain: Opportunities and limits of gender quotas , author=. Journal of Women, Politics & Policy , volume=. 2010 , publisher=

    work page 2010

  8. [8]

    Advances in Neural Information Processing Systems (

    Fair clustering through fairlets , author=. Advances in Neural Information Processing Systems (

    work page

  9. [9]

    Coresets for Clustering with Fairness Constraints , booktitle =

    Lingxiao Huang and Shaofeng H. Coresets for Clustering with Fairness Constraints , booktitle =

    work page

  10. [10]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Proportionally Fair Matching via Randomized Rounding , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    work page

  11. [11]

    International Conference on Machine Learning (ICML) , pages =

    Xingyu Chen and Brandon Fain and Liang Lyu and Kamesh Munagala , title =. International Conference on Machine Learning (ICML) , pages =

    work page

  12. [12]

    Approximation, Randomization, and Combinatorial Optimization

    On the Cost of Essentially Fair Clusterings , author=. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019) , pages=. 2019 , organization=

    work page 2019

  13. [13]

    International Conference on Integer Programming and Combinatorial Optimization , pages=

    A Constant-Factor Approximation for Pairwise Fair k-Center Clustering , author=. International Conference on Integer Programming and Combinatorial Optimization , pages=. 2025 , organization=

    work page 2025

  14. [14]

    Journal of Computer and System Sciences , volume=

    On coresets for fair clustering in metric and euclidean spaces and their applications , author=. Journal of Computer and System Sciences , volume=. 2024 , publisher=

    work page 2024

  15. [15]

    International Conference on Artificial Intelligence and Statistics (AISTATS) , pages =

    Fair Correlation Clustering , author =. International Conference on Artificial Intelligence and Statistics (AISTATS) , pages =. 2020 , volume =

    work page 2020

  16. [16]

    arXiv preprint arXiv:2002.03508 , year=

    Fair correlation clustering , author=. arXiv preprint arXiv:2002.03508 , year=

    work page arXiv 2002

  17. [17]

    1998 , publisher=

    Theory of linear and integer programming , author=. 1998 , publisher=

    work page 1998

  18. [18]

    International Conference on Artificial Intelligence and Statistics , pages=

    Improved approximation for fair correlation clustering , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2023 , organization=

    work page 2023

  19. [19]

    Towards Fair Representation: Clustering and Consensus , booktitle =

    Diptarka Chakraborty and Kushagra Chatterjee and Debarati Das and Tien Long Nguyen and Romina Nobahari , editor =. Towards Fair Representation: Clustering and Consensus , booktitle =

    work page

  20. [20]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    work page

  21. [21]

    arXiv preprint arXiv:2602.11500 , year=

    A Generic Framework for Fair Consensus Clustering in Streams , author=. arXiv preprint arXiv:2602.11500 , year=

    work page arXiv

  22. [22]

    1996 , publisher=

    Analyzing and modeling rank data , author=. 1996 , publisher=

    work page 1996

  23. [23]

    Proceedings of the 2003 ACM SIGMOD international conference on Management of data , pages=

    Efficient similarity search and classification via rank aggregation , author=. Proceedings of the 2003 ACM SIGMOD international conference on Management of data , pages=

    work page 2003

  24. [24]

    2009 , publisher=

    Pihur, Vasyl and Datta, Susmita and Datta, Somnath , journal=. 2009 , publisher=

    work page 2009

  25. [25]

    Foundations and trends

    Learning to rank for information retrieval , author=. Foundations and trends. 2009 , publisher=

    work page 2009

  26. [26]

    2011 , publisher=

    Majority judgment: measuring, ranking, and electing , author=. 2011 , publisher=

    work page 2011

  27. [27]

    Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval , pages=

    Models for metasearch , author=. Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval , pages=

    work page

  28. [28]

    1999 , publisher=

    Integer and combinatorial optimization , author=. 1999 , publisher=

    work page 1999

  29. [29]

    SIAM Journal on discrete mathematics , volume=

    Comparing top k lists , author=. SIAM Journal on discrete mathematics , volume=. 2003 , publisher=

    work page 2003

  30. [30]

    Combinatorica , volume=

    The ellipsoid method and its consequences in combinatorial optimization , author=. Combinatorica , volume=. 1981 , publisher=

    work page 1981

  31. [31]

    Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

    How to aggregate Top-lists: Approximation algorithms via scores and average ranks , author=. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2020 , organization=

    work page 2020

  32. [32]

    Discrete applied mathematics , volume=

    A simplified NP-complete satisfiability problem , author=. Discrete applied mathematics , volume=. 1984 , publisher=

    work page 1984

  33. [33]

    Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence,

    Improved Rank Aggregation Under Fairness Constraint , author =. Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence,. 2025 , month =

    work page 2025

  34. [34]

    Daedalus , volume=

    Mathematics without numbers , author=. Daedalus , volume=. 1959 , publisher=

    work page 1959

  35. [35]

    SIAM Journal on applied Mathematics , volume=

    A consistent extension of Condorcet’s election principle , author=. SIAM Journal on applied Mathematics , volume=. 1978 , publisher=

    work page 1978

  36. [36]

    American Political science review , volume=

    Condorcet's theory of voting , author=. American Political science review , volume=. 1988 , publisher=

    work page 1988

  37. [37]

    , author=

    Ranking Algorithms. , author=

    work page

  38. [38]

    Greenwade

    George D. Greenwade. The C omprehensive T ex A rchive N etwork ( CTAN ). TUGBoat. 1993

    work page 1993

  39. [39]

    Proceedings of the 10th international conference on World Wide Web , pages=

    Rank aggregation methods for the web , author=. Proceedings of the 10th international conference on World Wide Web , pages=

    work page

  40. [40]

    Theoretical computer science , volume=

    Multiple genome rearrangement by swaps and by element duplications , author=. Theoretical computer science , volume=. 2007 , publisher=

    work page 2007

  41. [41]

    Journal of the ACM (JACM) , volume=

    Aggregating inconsistent information: ranking and clustering , author=. Journal of the ACM (JACM) , volume=. 2008 , publisher=

    work page 2008

  42. [42]

    Discrete Mathematics , volume=

    On the complexity of crossings in permutations , author=. Discrete Mathematics , volume=. 2009 , publisher=

    work page 2009

  43. [43]

    Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

    Rank aggregation via nuclear norm minimization , author=. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

    work page

  44. [44]

    Advances in Neural Information Processing Systems , volume=

    Generalized method-of-moments for rank aggregation , author=. Advances in Neural Information Processing Systems , volume=

    work page

  45. [45]

    Journal of Discrete Algorithms , volume=

    On the hardness of maximum rank aggregation problems , author=. Journal of Discrete Algorithms , volume=. 2015 , publisher=

    work page 2015

  46. [46]

    2016 , publisher=

    Handbook of computational social choice , author=. 2016 , publisher=

    work page 2016

  47. [47]

    ACM Transactions on Algorithms (TALG) , volume=

    Exploring the complexity of layout parameters in tournaments and semicomplete digraphs , author=. ACM Transactions on Algorithms (TALG) , volume=. 2018 , publisher=

    work page 2018

  48. [48]

    Algorithmica , volume=

    A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs , author=. Algorithmica , volume=. 2021 , publisher=. doi:10.1007/s00453-021-00847-1 , note=

    work page doi:10.1007/s00453-021-00847-1 2021

  49. [49]

    Advances in Neural Information Processing Systems , volume=

    Fair rank aggregation , author=. Advances in Neural Information Processing Systems , volume=. 2022 , note =

    work page 2022

  50. [50]

    Proceedings of the 2022 international conference on management of data , pages=

    Rank aggregation with proportionate fairness , author=. Proceedings of the 2022 international conference on management of data , pages=

    work page 2022

  51. [51]

    Bartholdi and C.A

    J.J. Bartholdi and C.A. Tovey and M.A. Trick , title =. Social Choice and Welfare , volume =

    work page

  52. [52]

    2001 , publisher=

    Rank aggregation revisited , author=. 2001 , publisher=

    work page 2001

  53. [53]

    Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , pages=

    How to rank with few errors , author=. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , pages=

    work page

  54. [54]

    SODA , pages=

    Deterministic pivoting algorithms for constrained ranking and clustering problems , author=. SODA , pages=

    work page

  55. [55]

    Elisa Celis and Damian Straszak and Nisheeth K

    L. Elisa Celis and Damian Straszak and Nisheeth K. Vishnoi , title =. International Colloquium on Automata, Languages, and Programming (ICALP) , volume =

    work page

  56. [56]

    Essai sur l'application de l'analyse

    Condorcet, Nicolas de , year=. Essai sur l'application de l'analyse

    work page

  57. [57]

    Borda , title =

    J. Borda , title =. Histoire de l'Acad\'emie Royale des Sciences , year =

    work page

  58. [58]

    Proceedings of the 21st conference on Artificial intelligence , pages=

    Improved bounds for computing Kemeny rankings , author=. Proceedings of the 21st conference on Artificial intelligence , pages=. 2006 , organization=

    work page 2006

  59. [59]

    Advances in neural information processing systems , volume=

    Coresets for clustering with fairness constraints , author=. Advances in neural information processing systems , volume=

    work page

  60. [60]

    International conference on machine learning , pages=

    Proportionally fair clustering , author=. International conference on machine learning , pages=. 2019 , organization=

    work page 2019

  61. [61]

    Advances in Neural Information Processing Systems , volume=

    Fair algorithms for clustering , author=. Advances in Neural Information Processing Systems , volume=

    work page

  62. [62]

    International Conference on Machine Learning , pages=

    Scalable fair clustering , author=. International Conference on Machine Learning , pages=. 2019 , organization=

    work page 2019

  63. [63]

    Journal of Machine Learning Research , volume=

    CVXPY: A Python-embedded modeling language for convex optimization , author=. Journal of Machine Learning Research , volume=

    work page

  64. [64]

    2024 , url =

    Suresh Bolusani and Mathieu Besan. 2024 , url =

    work page 2024

  65. [65]

    Proceedings of the VLDB Endowment , volume=

    Rank aggregation algorithms for fair consensus , author=. Proceedings of the VLDB Endowment , volume=

    work page

  66. [66]

    Economic and Political Weekly , pages=

    Social exclusion and jobs reservation in India , author=. Economic and Political Weekly , pages=. 2010 , publisher=

    work page 2010

  67. [67]

    2005 , publisher=

    Affirmative action in India and the United States , author=. 2005 , publisher=

    work page 2005

  68. [68]

    Computers in Human Behavior , volume=

    Who views online extremism? Individual attributes leading to exposure , author=. Computers in Human Behavior , volume=. 2016 , publisher=

    work page 2016

  69. [69]

    Unequal representation and gender stereotypes in image search results for occupations , author=

    work page

  70. [70]

    Advances in Neural Information Processing Systems (NeurIPS) , volume=

    Man is to computer programmer as woman is to homemaker? debiasing word embeddings , author=. Advances in Neural Information Processing Systems (NeurIPS) , volume=

    work page

  71. [71]

    Algorithmica , volume=

    Proportionate progress: A notion of fairness in resource allocation , author=. Algorithmica , volume=. 1996 , publisher=

    work page 1996

  72. [72]

    2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW) , pages=

    Fairness in Ranking: Robustness through Randomization without the Protected Attribute , author=. 2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW) , pages=. 2024 , organization=

    work page 2024

  73. [73]

    International Conference on Artificial Intelligence and Statistics , pages=

    Fair disaster containment via graph-cut problems , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2022 , organization=

    work page 2022

  74. [74]

    Proceedings of the forty-third annual ACM symposium on Theory of computing , pages=

    A unified framework for approximating and clustering data , author=. Proceedings of the forty-third annual ACM symposium on Theory of computing , pages=

    work page

  75. [75]

    International conference on artificial intelligence and statistics , pages=

    One-shot coresets: The case of k-clustering , author=. International conference on artificial intelligence and statistics , pages=. 2018 , organization=

    work page 2018

  76. [76]

    Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

    Coresets for clustering in excluded-minor graphs and beyond , author=. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=. 2021 , organization=

    work page 2021

  77. [77]

    Approximating the median under the

    Chakraborty, Diptarka and Das, Debarati and Krauthgamer, Robert , booktitle=. Approximating the median under the. 2021 , organization=

    work page 2021

  78. [78]

    14th Innovations in Theoretical Computer Science Conference (ITCS 2023) , year=

    Clustering Permutations: New Techniques with Streaming Applications , author=. 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) , year=

    work page 2023

  79. [79]

    Journal of the ACM (JACM) , volume=

    Theoretical improvements in algorithmic efficiency for network flow problems , author=. Journal of the ACM (JACM) , volume=. 1972 , publisher=

    work page 1972