Cover Image

Improved Rank Aggregation under Fairness Constraint

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Diptarka, Das, Himika, Dey, Sanjana, Yan, Alvin Hong Yao
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
by: Chakraborty, Diptarka, et al.
Published: (2026)

Explaining Rankings with Hidden Group Bonuses
by: Yan, Alvin Hong Yao, et al.
Published: (2026)

Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025)

Equivalence Testing: The Power of Bounded Adaptivity
by: Chakraborty, Diptarka, et al.
Published: (2024)

Clustering Permutations: New Techniques with Streaming Applications
by: Chakraborty, Diptarka, et al.
Published: (2022)

Many Flavors of Edit Distance
by: Bhattacharya, Sudatta, et al.
Published: (2024)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
by: Rui, Xiaobin, et al.
Published: (2025)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
by: Jäger, Sven, et al.
Published: (2024)

Efficient Dynamic Rank Aggregation
by: Alimi, Morteza, et al.
Published: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)

Fair Submodular Maximization over a Knapsack Constraint
by: Li, Lijun, et al.
Published: (2025)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
by: Chen, Wenjing, et al.
Published: (2026)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
by: Inamdar, Tanmay, et al.
Published: (2024)

Local Search-based Individually Fair Clustering with Outliers
by: Maity, Binita, et al.
Published: (2025)

Improved Approximation for Ranking on General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
by: Mahabadi, Sepideh, et al.
Published: (2026)

Clustering with Label Consistency
by: Chakraborty, Diptarka, et al.
Published: (2025)

SPIDER: Improved Succinct Rank and Select Performance
by: Laws, Matthew D., et al.
Published: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
by: Dastidar, Jeshu, et al.
Published: (2025)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
by: Zhu, Yanhui, et al.
Published: (2024)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
by: Björklund, Andreas, et al.
Published: (2024)

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
by: Gadekar, Ameet, et al.
Published: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
by: Bhore, Sujoy, et al.
Published: (2025)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
by: Turoczy, Alexander, et al.
Published: (2025)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
by: Shahbazi, Nima, et al.
Published: (2025)

Knapsack on Graphs with Relaxed Neighborhood Constraints
by: Dey, Palash, et al.
Published: (2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
by: Hao, Yimin, et al.
Published: (2025)

Matroid Intersection under Minimum Rank Oracle
by: Bárász, Mihály, et al.
Published: (2024)

Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
by: He, Di, et al.
Published: (2024)

On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
by: Das, Arun Kumar, et al.
Published: (2025)

Improved Lower Bounds for Privacy under Continual Release
by: Aryanfard, Bardiya, et al.
Published: (2025)

QuadRank: Engineering a High Throughput Rank
by: Koerkamp, R. Groot
Published: (2026)

Maximizing Diversity in (near-)Median String Selection
by: Chakraborty, Diptarka, et al.
Published: (2026)

Fair Set Cover
by: Dehghankar, Mohsen, et al.
Published: (2024)

The Steiner Path Aggregation Problem
by: Chen, Da Qi, et al.
Published: (2025)

Individual Fairness in Graph Decomposition
by: Munagala, Kamesh, et al.
Published: (2024)

Fault-Tolerant Approximate Distance Oracles with a Source Set
by: Dey, Dipan, et al.
Published: (2025)

Near Optimal Dual Fault Tolerant Distance Oracle
by: Dey, Dipan, et al.
Published: (2024)