Satisfying Complex Top-k Fairness Constraints by Preference Substitutions
Summary: Formulates the minimum preference-vote substitutions needed to enforce proportional representation in top-k selections across protected attributes. Develops provable algorithms for binary, multivalued, multi-attribute, and 3+ attribute fairness, with large-scale validation. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Md. Mouinul Islam (New Jersey Institute of Technology)
- 2. Dong Wei (New Jersey Institute of Technology)
- 3. Baruch Schieber (New Jersey Institute of Technology)
- 4. Senjuti Basu Roy (New Jersey Institute of Technology)
BibTeX Citation
@article{islam_vldb23,
title = {{Satisfying Complex Top-k Fairness Constraints by Preference Substitutions}},
author = {Islam, Md. Mouinul and Wei, Dong and Schieber, Baruch and Roy, Senjuti Basu},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {2},
pages = {317--329},
doi = {10.14778/3565816.3565832},
url = {https://doi.org/10.14778/3565816.3565832},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,389 | Query Refinement for Diverse Top-k Selection | 2024 | SIGMOD | 5.8895166e-05 |
| 9,389 | Fairness in Preference Queries: Social Choice Theories Meet Data Management | 2024 | VLDB | 5.2755515e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,597 | Designing Fair Ranking Schemes | 2019 | SIGMOD | 0.00010246472 |
| 3,534 | Location-Aware Type Ahead Search on Spatial Databases: Semantics and Efficiency | 2011 | SIGMOD | 7.3347488e-05 |
| 3,608 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 7.2609441e-05 |
| 4,915 | Crowdsourced Top-k Algorithms: An Experimental Evaluation | 2016 | VLDB | 6.4477856e-05 |
| 7,449 | Rank Aggregation with Proportionate Fairness | 2022 | SIGMOD | 5.614576e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,278 | Why Not Yet: Fixing a Top-k Ranking that Is Not Fair to Individuals | 2023 | VLDB |
| 2 | 4,610 | Top-k Sorting Under Partial Order Information | 2018 | SIGMOD |
| 3 | 12,544 | A Fair Assignment Algorithm for Multiple Preference Queries | 2009 | VLDB |
| 4 | 9,848 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB |
| 5 | 11,175 | Faster Algorithms for Fair Max-Min Diversification in Rd | 2024 | SIGMOD |
| 6 | 9,393 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB |
| 7 | 1,597 | Designing Fair Ranking Schemes | 2019 | SIGMOD |
| 8 | 9,389 | Fairness in Preference Queries: Social Choice Theories Meet Data Management | 2024 | VLDB |
| 9 | 11,419 | Equitable Top-k Results for Long Tail Data | 2023 | SIGMOD |
| 10 | 7,449 | Rank Aggregation with Proportionate Fairness | 2022 | SIGMOD |