A Graph-based Approach for Mitigating Multi-sided Exposure Bias in Recommender Systems
Masoud Mansoury, Himan Abdollahpouri, Mykola Pechenizkiy, Bamshad, Mobasher, Robin Burke

TL;DR
This paper introduces FairMatch, a graph-based post-processing algorithm that enhances exposure fairness and diversity in recommender systems without significantly sacrificing recommendation relevance.
Contribution
The paper presents a novel graph-based algorithm, FairMatch, for post-processing recommendations to improve fairness and diversity across multiple stakeholders.
Findings
Significantly improves exposure fairness and aggregate diversity.
Maintains acceptable relevance levels in recommendations.
Outperforms state-of-the-art baselines in experiments.
Abstract
Fairness is a critical system-level objective in recommender systems that has been the subject of extensive recent research. A specific form of fairness is supplier exposure fairness where the objective is to ensure equitable coverage of items across all suppliers in recommendations provided to users. This is especially important in multistakeholder recommendation scenarios where it may be important to optimize utilities not just for the end-user, but also for other stakeholders such as item sellers or producers who desire a fair representation of their items. This type of supplier fairness is sometimes accomplished by attempting to increasing aggregate diversity in order to mitigate popularity bias and to improve the coverage of long-tail items in recommendations. In this paper, we introduce FairMatch, a general graph-based algorithm that works as a post processing approach after…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
