Guaranteeing Accuracy and Fairness under Fluctuating User Traffic: A Bankruptcy-Inspired Re-ranking Approach
Xiaopeng Ye, Chen Xu, Jun Xu, Xuyang Xie, Gang Wang, Zhenhua Dong

TL;DR
This paper introduces BankFair, a novel re-ranking method inspired by bankruptcy economics, to ensure consistent accuracy and fairness in recommendation systems amidst fluctuating user traffic.
Contribution
It proposes a bankruptcy-inspired re-ranking approach that guarantees long-term fairness and short-term accuracy despite variable user traffic levels.
Findings
BankFair outperforms baseline methods in accuracy and fairness.
The Talmud rule effectively balances fairness during traffic fluctuations.
User traffic significantly impacts fairness-accuracy trade-offs.
Abstract
Out of sustainable and economical considerations, two-sided recommendation platforms must satisfy the needs of both users and providers. Previous studies often show that the two sides' needs show different urgency: providers need a relatively long-term exposure demand while users want more short-term and accurate service. However, our empirical study reveals that previous methods for trading off fairness-accuracy often fail to guarantee long-term fairness and short-term accuracy simultaneously in real applications of fluctuating user traffic. Especially, when user traffic is low, the user experience often drops a lot. Our theoretical analysis also confirms that user traffic is a key factor in such a trade-off problem. How to guarantee accuracy and fairness under fluctuating user traffic remains a problem. Inspired by the bankruptcy problem in economics, we propose a novel fairness-aware…
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
Methodstravel james
