Problem
Research questions and friction points this paper is trying to address.
fair consensus ranking
tie-aware rankings
rank aggregation
Unpublished Draft: A Post-Processing Approach to Fairness in Tie-Aware Rankings
🤖 AI Summary
研究针对带平局的排名提出了一种后处理方法，通过精确算法和快速启发式方法来确定最接近的公平共识排名。
📝 Abstract
The problem of finding a fair consensus ranking is an active research topic in the domain of fair rank aggregation and has been well studied; however, existing studies predominantly consider both the input rankings and the output ranking to be permutations where elements are always strictly ordered. In practice, however, a ranking with ties is far more common. This study bridges this gap by presenting a post-processing approach to determine the closest fair consensus ranking when an unfair tie-aware consensus ranking is provided. It proposes an exact algorithm and a fast heuristic to achieve this.
Innovation
Methods, ideas, or system contributions that make the work stand out.
post-processing approach
tie-aware rankings
fair consensus ranking
🔎 Similar Papers
2024-10-07arXiv.orgCitations: 1
