Online Certification of Preference-Based Fairness for Personalized Recommender Systems
Virginie Do, Sam Corbett-Davies, Jamal Atif, Nicolas Usunier
Abstract
Recommender systems are facing scrutiny because of their growing impact on the opportunities we have access to. Current audits for fairness are limited to coarse-grained parity assessments at the level of sensitive groups. We propose to audit for envy-freeness, a more granular criterion aligned with individual preferences: every user should prefer their recommendations to those of other users. Since auditing for envy requires to estimate the preferences of users beyond their existing recommendations, we cast the audit as a new pure exploration problem in multi-armed bandits. We propose a sample-efficient algorithm with theoretical guarantees that it does not deteriorate user experience. We also study the trade-offs achieved on real-world recommendation datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e7aedab6-613a-4759-bec4-1f964140544cCited by top-tier papers12
- Two-sided fairness in rankings via Lorenz dominanceVirginie Do, Sam Corbett-Davies, Jamal Atif, Nicolas UsunierNeurIPS 2021 · 64 citations
- Intersectional Two-sided Fairness in RecommendationYifan Wang, Peijie Sun, Weizhi Ma, Min Zhang et al.WWW 2024 · 27 citations
- Fair Ranking as Fair Division: Impact-Based Individual Fairness in RankingYuta Saito, Thorsten JoachimsKDD 2022 · 23 citations
- Optimizing Generalized Gini Indices for Fairness in RankingsVirginie Do, Nicolas UsunierSIGIR 2022 · 19 citations
- Having your Privacy Cake and Eating it Too: Platform-supported Auditing of Social Media Algorithms for Public InterestBasileal Imana, Aleksandra Korolova, John S. HeidemannCSCW 2023 · 18 citations
Builds on3
- FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided PlatformsGourab K. Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi et al.WWW 2020 · 268 citations
- Auditing for Discrimination in Algorithms Delivering Job AdsBasileal Imana, Aleksandra Korolova, John S. HeidemannWWW 2021 · 105 citations
- Improved Algorithms for Conservative Exploration in BanditsEvrard Garcelon, Mohammad Ghavamzadeh, Alessandro Lazaric, Matteo PirottaAAAI 2020 · 24 citations
Related papers
- Fiduciary BanditsGal Bahar, Omer Ben-Porat, Kevin Leyton-Brown, Moshe TennenholtzICML 2020 · 9 citations
- Fairness of Exposure in Stochastic BanditsLequn Wang, Yiwei Bai, Wen Sun, Thorsten JoachimsICML 2021 · 60 citations
- Incentivizing Combinatorial Bandit ExplorationXinyan Hu, Dung Daniel T. Ngo, Aleksandrs Slivkins, Zhiwei Steven WuNeurIPS 2022 · 14 citations
- Differentially Private Anonymous Bandits for Multi-User SystemsMohammad Reza Badri, Hossein Esfandiari, Samira Hossein Ghorban, Alireza RezaeimoghadamWWW 2026
- Statistical Parity with Exponential WeightsStephen Pasteris, Chris Hicks, Vasilios MavroudisNeurIPS 2025
