2000 character limit reached
Seller-side Outcome Fairness in Online Marketplaces (2312.03253v1)
Published 6 Dec 2023 in cs.LG and math.OC
Abstract: This paper aims to investigate and achieve seller-side fairness within online marketplaces, where many sellers and their items are not sufficiently exposed to customers in an e-commerce platform. This phenomenon raises concerns regarding the potential loss of revenue associated with less exposed items as well as less marketplace diversity. We introduce the notion of seller-side outcome fairness and build an optimization model to balance collected recommendation rewards and the fairness metric. We then propose a gradient-based data-driven algorithm based on the duality and bandit theory. Our numerical experiments on real e-commerce data sets show that our algorithm can lift seller fairness measures while not hurting metrics like collected Gross Merchandise Value (GMV) and total purchases.
- Fighting fire with fire: Using antidote data to improve polarization and fairness of recommender systems. In Proceedings of the twelfth ACM international conference on web search and data mining, pages 231–239, 2019.
- How algorithmic confounding in recommendation systems increases homogeneity and decreases utility. In Proceedings of the 12th ACM conference on recommender systems, pages 224–232, 2018.
- Managing popularity bias in recommender systems with personalized re-ranking. arXiv preprint arXiv:1901.07555, 2019.
- User-oriented fairness in recommendation. In Proceedings of the Web Conference 2021, pages 624–632, 2021.
- Fairness in rankings and recommendations: an overview. The VLDB Journal, pages 1–28, 2022.
- Cold start to improve market thickness on online advertising platforms: Data-driven algorithms and field experiments. Management Science, 69(7):3838–3860, 2023.
- Online stochastic packing applied to display ad allocation. In Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I 18, pages 182–194. Springer, 2010.
- The best of many worlds: Dual mirror descent for online allocation problems. Operations Research, 71(1):101–119, 2023.
- Bypassing the monster: A faster and simpler optimal algorithm for contextual bandits under realizability. Mathematics of Operations Research, 47(3):1904–1931, 2022.
- Repeated auctions with budgets in ad exchanges: Approximations and design. Management Science, 61(4):864–884, 2015.
- Adwords and generalized online matching. Journal of the ACM (JACM), 54(5):22–es, 2007.
- The adwords problem: online keyword matching with budgeted bidders under random permutations. In Proceedings of the 10th ACM conference on Electronic commerce, pages 71–78, 2009.
- Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pages 208–214. JMLR Workshop and Conference Proceedings, 2011.
- Thompson sampling for contextual bandits with linear payoffs. In International conference on machine learning, pages 127–135. PMLR, 2013.
- Fairness-aware classifier with prejudice remover regularizer. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part II 23, pages 35–50. Springer, 2012.
- Beyond parity: Fairness objectives for collaborative filtering. Advances in neural information processing systems, 30, 2017.
- A fairness-aware hybrid recommender system. arXiv preprint arXiv:1809.09030, 2018.
- Equality of opportunity in supervised learning. Advances in neural information processing systems, 29, 2016.
- Data decisions and theoretical implications when adversarially learning fair representations. arXiv preprint arXiv:1707.00075, 2017.
- Fa* ir: A fair top-k ranking algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pages 1569–1578, 2017.
- Controlling popularity bias in learning-to-rank recommendation. In Proceedings of the eleventh ACM conference on recommender systems, pages 42–46, 2017.
- Equity of attention: Amortizing individual fairness in rankings. In The 41st international acm sigir conference on research & development in information retrieval, pages 405–414, 2018.
- Controlling fairness and bias in dynamic learning-to-rank. In Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pages 429–438, 2020.
- The price of fairness. Operations research, 59(1):17–31, 2011.
- On the efficiency-fairness trade-off. Management Science, 58(12):2234–2250, 2012.
- Elad Hazan et al. Introduction to online convex optimization. Foundations and Trends® in Optimization, 2(3-4):157–325, 2016.
- Regularized online allocation problems: Fairness and beyond. In International Conference on Machine Learning, pages 630–639. PMLR, 2021.
- An empirical evaluation of thompson sampling. Advances in neural information processing systems, 24, 2011.
- Micheal Kechinov. ecommerce events history in electronics store. https://www.kaggle.com/datasets/mkechinov/ecommerce-events-history-in-electronics-store.
- Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In Proceedings of the fourth ACM international conference on Web search and data mining, pages 297–306, 2011.