Metraipolis › archive › dc_2affececf153

Unpublished Draft: A Post-Processing Approach to Fairness in Tie-Aware Rankings — arXiv:2608.26478

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.26478
License (as archived): CC0-1.0
Archived: 2026-10-17T19:20:25.963Z
SHA-256 of the archived text: 54051d6a594d23a0268d7db6b29b6c9d66136faae4916b2213d2394bd212d502
Stable URL of this page: https://metraipolis.com/documento/dc_2affececf153

How to cite

Unpublished Draft: A Post-Processing Approach to Fairness in Tie-Aware Rankings — arXiv:2608.26478 — arXiv (en), https://arxiv.org/abs/2608.26478 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2affececf153 (Metraipolis archive dc_2affececf153, sha256 54051d6a594d23a0268d7db6b29b6c9d66136faae4916b2213d2394bd212d502)

BibTeX

@misc{dc2affececf153,
  title = {Unpublished Draft: A Post-Processing Approach to Fairness in Tie-Aware Rankings — arXiv:2608.26478},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.26478},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2affececf153; sha256 54051d6a594d23a0268d7db6b29b6c9d66136faae4916b2213d2394bd212d502},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26478. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.26478 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T19:16:36.837Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).