Database Paper Browser

Back to papers

Satisfying Complex Top-k Fairness Constraints by Preference Substitutions

Summary: Margin-finding for top-k under complex proportionate fairness via single-ballot substitutions: minimize vote reassignments to satisfy group-quota constraints across binary/multivalued and multi-attribute protected settings. Characterizes complexity, designs algorithms with provable guarantees, and validates scalability on real datasets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13154
Venue
VLDB
Year
2023
Pagerank
4.4187185e-05
Overall Rank
8,972 | 37.59%
DOI
10.14778/3565816.3565832

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,649 Query Refinement for Diverse Top-k Selection 2024 SIGMOD 5.3911246e-05
9,241 Fairness in Preference Queries: Social Choice Theories Meet Data Management 2024 VLDB 4.3690661e-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.00011209846
3,570 Location-Aware Type Ahead Search on Spatial Databases: Semantics and Efficiency 2011 SIGMOD 6.958427e-05
3,802 Group Recommendation: Semantics and Efficiency 2009 VLDB 6.7552492e-05
4,579 Crowdsourced Top-k Algorithms: An Experimental Evaluation 2016 VLDB 6.070469e-05
7,632 Rank Aggregation with Proportionate Fairness 2022 SIGMOD 4.6915165e-05
Previous Page 1 / 1 Next

Semantically Similar Papers