Metraipolis › archive › dc_f79d5c97f261
Hidden Disparities in Ranking: Category-Aware Fairness via Distributional Stability — arXiv:2610.40182
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40182
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:27:20.767Z
- SHA-256 of the archived text
b6e68c6387c7693bd0eaf0bfed5f7ca34140eb1a03c1cad8e938f28cd70b6bda- Stable URL of this page
https://metraipolis.com/documento/dc_f79d5c97f261
How to cite
Hidden Disparities in Ranking: Category-Aware Fairness via Distributional Stability — arXiv:2610.40182 — arXiv (en), https://arxiv.org/abs/2610.40182 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f79d5c97f261 (Metraipolis archive dc_f79d5c97f261, sha256 b6e68c6387c7693bd0eaf0bfed5f7ca34140eb1a03c1cad8e938f28cd70b6bda)
BibTeX
@misc{dcf79d5c97f261,
title = {Hidden Disparities in Ranking: Category-Aware Fairness via Distributional Stability — arXiv:2610.40182},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40182},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f79d5c97f261; sha256 b6e68c6387c7693bd0eaf0bfed5f7ca34140eb1a03c1cad8e938f28cd70b6bda},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40182. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the problem of fair ranking in recommender systems. We provide a formal probabilistic framework in which ranking policies are distributions over permutations, and the utility of a user is the exposure given to the items they interact with, relative to that of an ideal ranking. We consider utility parity across user groups, as well as its category-aware refinement, conditional utility parity, which requires parity within each category of items. Following a recent view of fairness as distributional stability, we show that both criteria are equivalent to the stability of the utility under changes in the composition of user groups. Optimizing over mixtures of ranking policies leads to a second-order cone program, for which we provide generalization bounds. A numerical study validates our theoretical findings. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.40182 — 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-11-01T02:12:44.320Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).