An Item-side Competitive Fairness for Recommender Systems

The ranking algorithm of the recommender system would influence the utilities of both the users and the item producers. An algorithm that only optimizes users’ utility may lead to an unfair distribution of exposure over the items and further hurt the utility of the corresponding item producers. To address this issue, researchers and practitioners have recently proposed ensuring a fair exposure distribution among all the items. However, we argue that the ultimate goal of item-side fairness is not to ensure any items would receive exposure equally or proportional to their merit but to foster fair competition among the producers on the platform. Therefore, this paper introduces a novel item-side individual fairness named competitive fairness based on the competitive relationship between item producers. Competitive fairness argues that the key to fostering fair market competition resides in ensuring exposure equity among items with competitive relationships rather than items without competitive relationships.We further define a competitive fairness metric based on these assumptions and propose a G radient-based R e-ranking algorithm for C ompetitive F airness (GRCF) to optimize the proposed competitive fairness metric while maintaining good ranking quality. We conducted a series of simulation experiments to investigate how various competitive relationships impact our algorithm's performance. Experiments on several real-world datasets with genuine competitive relationships verify that our approach can achieve superior performance compared to the baselines and that the effectiveness of our algorithm is independent of the specific recommendation algorithm used.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Information Systems
Published
2026-11-19
DOI
https://doi.org/10.1145/3863933
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

An Item-side Competitive Fairness for Recommender Systems

Xiang Li, Fei Jiang, Jiaxin Mao, Wei Lin et al.
ACM Transactions on Information Systems
Recommender Systems and Techniques
article

An Item-side Competitive Fairness for Recommender Systems

Xiang Li, Fei Jiang, Jiaxin Mao, Wei Lin, Ruidong Han, Weizhi Ma, Lu Guan, Qiangqiang Ren
article en

Abstract

The ranking algorithm of the recommender system would influence the utilities of both the users and the item producers. An algorithm that only optimizes users’ utility may lead to an unfair distribution of exposure over the items and further hurt the utility of the corresponding item producers. To address this issue, researchers and practitioners have recently proposed ensuring a fair exposure distribution among all the items. However, we argue that the ultimate goal of item-side fairness is not to ensure any items would receive exposure equally or proportional to their merit but to foster fair competition among the producers on the platform. Therefore, this paper introduces a novel item-side individual fairness named competitive fairness based on the competitive relationship between item producers. Competitive fairness argues that the key to fostering fair market competition resides in ensuring exposure equity among items with competitive relationships rather than items without competitive relationships.We further define a competitive fairness metric based on these assumptions and propose a G radient-based R e-ranking algorithm for C ompetitive F airness (GRCF) to optimize the proposed competitive fairness metric while maintaining good ranking quality. We conducted a series of simulation experiments to investigate how various competitive relationships impact our algorithm's performance. Experiments on several real-world datasets with genuine competitive relationships verify that our approach can achieve superior performance compared to the baselines and that the effectiveness of our algorithm is independent of the specific recommendation algorithm used.

ACM Transactions on Information Systems
Meituan (China) (CN), Renmin University of China (CN), Tsinghua University (CN)
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon