User-item matching for recommendation fairness
Qiang Dong, Shuang-Shuang Xie, Wen-Jun Li

TL;DR
This paper introduces a novel user-item matching approach that enhances recommendation fairness for item-providers by limiting item exposure based on past interactions, while maintaining or improving recommendation accuracy.
Contribution
It proposes a stock volume constraint method and a parameter-free MCMF-based model to improve item exposure fairness without sacrificing accuracy.
Findings
Achieves superior item exposure fairness compared to common recommenders.
Maintains or improves recommendation accuracy relative to baseline algorithms.
Parameter-free strategy simplifies implementation and tuning.
Abstract
As we all know, users and item-providers are two main parties of participants in recommender systems. However, most existing research efforts on recommendation were focused on better serving users and overlooked the purpose of item-providers. This paper is devoted to improve the item exposure fairness for item-providers' objective, and keep the recommendation accuracy not decreased or even improved for users' objective. We propose to set stock volume constraints on items, to be specific, limit the maximally allowable recommended times of an item to be proportional to the frequency of its being interacted in the past, which is validated to achieve superior item exposure fairness to common recommenders and thus mitigates the Matthew Effect on item popularity. With the two constraints of pre-existing recommendation length of users and our stock volumes of items, a heuristic strategy based…
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.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Optimization and Search Problems
