TL;DR
This paper introduces a new fairness framework for rankings based on fair division principles, addressing limitations of exposure-based fairness by focusing on impact and individual item fairness, with theoretical guarantees and empirical validation.
Contribution
It develops an axiomatic approach to ranking fairness rooted in fair division, avoiding reliance on link functions and providing new fairness guarantees.
Findings
The proposed method guarantees envy-freeness and Pareto optimality.
It outperforms traditional exposure-based fairness in reducing envy and impact disparity.
Empirical results show effective control of fairness-utility trade-offs.
Abstract
Rankings have become the primary interface in two-sided online markets. Many have noted that the rankings not only affect the satisfaction of the users (e.g., customers, listeners, employers, travelers), but that the position in the ranking allocates exposure -- and thus economic opportunity -- to the ranked items (e.g., articles, products, songs, job seekers, restaurants, hotels). This has raised questions of fairness to the items, and most existing works have addressed fairness by explicitly linking item exposure to item relevance. However, we argue that any particular choice of such a link function may be difficult to defend, and we show that the resulting rankings can still be unfair. To avoid these shortcomings, we develop a new axiomatic approach that is rooted in principles of fair division. This not only avoids the need to choose a link function, but also more meaningfully…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
