Seller-side Outcome Fairness in Online Marketplaces
- URL: http://arxiv.org/abs/2312.03253v1
- Date: Wed, 6 Dec 2023 02:58:49 GMT
- Title: Seller-side Outcome Fairness in Online Marketplaces
- Authors: Zikun Ye, Reza Yousefi Maragheh, Lalitesh Morishetti, Shanu
Vashishtha, Jason Cho, Kaushiki Nag, Sushant Kumar, Kannan Achan
- Abstract summary: We introduce the notion of seller-side outcome fairness and build an optimization model to balance collected recommendation rewards and the fairness metric.
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.
- Score: 8.29306513718005
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- A survey on fairness of large language models in e-commerce: progress, application, and challenge [8.746342211863332]
This survey explores the fairness of large language models (LLMs) in e-commerce.
It examines their progress, applications, and the challenges they face.
The paper critically addresses the fairness challenges in e-commerce, highlighting how biases in training data and algorithms can lead to unfair outcomes.
arXiv Detail & Related papers (2024-05-15T23:25:19Z) - Towards Fair Allocation in Social Commerce Platforms [18.76499687585534]
Social commerce platforms are emerging businesses where producers sell products through re-sellers who advertise the products to other customers in their social network.
In this work, we focus on the fairness of such allocations in social commerce platforms and formulate the problem of assigning products to re-sellers as a fair division problem with indivisible items under two-sided cardinality constraints.
Our work systematically explores various well-studied benchmarks of fairness -- including Nash social welfare, envy-freeness up to one item (EF1), and equitability up to one item (EQ1) -- from both theoretical and experimental perspectives.
arXiv Detail & Related papers (2024-02-20T06:58:00Z) - An Auction-based Marketplace for Model Trading in Federated Learning [54.79736037670377]
Federated learning (FL) is increasingly recognized for its efficacy in training models using locally distributed data.
We frame FL as a marketplace of models, where clients act as both buyers and sellers.
We propose an auction-based solution to ensure proper pricing based on performance gain.
arXiv Detail & Related papers (2024-02-02T07:25:53Z) - Federated Learning Incentive Mechanism under Buyers' Auction Market [2.316580879469592]
Auction-based Federated Learning (AFL) enables open collaboration among self-interested data consumers and data owners.
We adapt the procurement auction framework, aiming to explain the pricing behavior under buyers' market.
In order to select clients with high reliability and data quality, and to prevent from external attacks, we utilize a blockchain-based reputation mechanism.
arXiv Detail & Related papers (2023-09-10T16:09:02Z) - Fair-CDA: Continuous and Directional Augmentation for Group Fairness [48.84385689186208]
We propose a fine-grained data augmentation strategy for imposing fairness constraints.
We show that group fairness can be achieved by regularizing the models on transition paths of sensitive features between groups.
Our proposed method does not assume any data generative model and ensures good generalization for both accuracy and fairness.
arXiv Detail & Related papers (2023-04-01T11:23:00Z) - Competition, Alignment, and Equilibria in Digital Marketplaces [97.03797129675951]
We study a duopoly market where platform actions are bandit algorithms and the two platforms compete for user participation.
Our main finding is that competition in this market does not perfectly align market outcomes with user utility.
arXiv Detail & Related papers (2022-08-30T17:43:58Z) - Towards Revenue Maximization with Popular and Profitable Products [69.21810902381009]
A common goal for companies marketing is to maximize the return revenue/profit by utilizing the various effective marketing strategies.
Finding credible and reliable information on products' profitability is difficult since most products tends to peak at certain times.
This paper proposes a general profit-oriented framework to address the problem of revenue based on economic behavior, and conducting the 0n-shelf Popular and most Profitable Products (OPPPs) for the targeted marketing.
arXiv Detail & Related papers (2022-02-26T02:07:25Z) - Macroscopic properties of buyer-seller networks in online marketplaces [55.41644538483948]
We analyze two datasets containing 245M transactions that took place on online marketplaces between 2010 and 2021.
We show that transactions in online marketplaces exhibit strikingly similar patterns despite significant differences in language, lifetimes, products, regulation, and technology.
arXiv Detail & Related papers (2021-12-16T18:00:47Z) - Incentives for Item Duplication under Fair Ranking Policies [69.14168955766847]
We study the behaviour of different fair ranking policies in the presence of duplicates.
We find that fairness-aware ranking policies may conflict with diversity, due to their potential to incentivize duplication more than policies solely focused on relevance.
arXiv Detail & Related papers (2021-10-29T11:11:15Z) - A Graph-based Approach for Mitigating Multi-sided Exposure Bias in
Recommender Systems [7.3129791870997085]
We introduce FairMatch, a graph-based algorithm that improves exposure fairness for items and suppliers.
A comprehensive set of experiments on two datasets and comparison with state-of-the-art baselines show that FairMatch, while significantly improves exposure fairness and aggregate diversity, maintains an acceptable level of relevance of the recommendations.
arXiv Detail & Related papers (2021-07-07T18:01:26Z) - Controlling Fairness and Bias in Dynamic Learning-to-Rank [31.41843594914603]
We propose a learning algorithm that ensures notions of amortized group fairness, while simultaneously learning the ranking function from implicit feedback data.
The algorithm takes the form of a controller that integrates unbiased estimators for both fairness and utility.
In addition to its rigorous theoretical foundation and convergence guarantees, we find empirically that the algorithm is highly practical and robust.
arXiv Detail & Related papers (2020-05-29T17:57:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.