Towards Fair Allocation in Social Commerce Platforms

• URL: http://arxiv.org/abs/2402.12759v1
• Date: Tue, 20 Feb 2024 06:58:00 GMT
• Title: Towards Fair Allocation in Social Commerce Platforms
• Authors: Anjali Gupta, Shreyans J. Nagori, Abhijnan Chakraborty, Rohit Vaish, Sayan Ranu, Prajit Prashant Nadkarni, Narendra Varma Dasararaju, Muthusamy Chelliah
• Abstract summary: 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.
• Score: 18.76499687585534
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Social commerce platforms are emerging businesses where producers sell products through re-sellers who advertise the products to other customers in their social network. Due to the increasing popularity of this business model, thousands of small producers and re-sellers are starting to depend on these platforms for their livelihood; thus, it is important to provide fair earning opportunities to them. The enormous product space in such platforms prohibits manual search, and motivates the need for recommendation algorithms to effectively allocate product exposure and, consequently, earning opportunities. 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, wherein each product must be given to at least a certain number of re-sellers and each re-seller must get a certain number of products. 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. We find that the existential and computational guarantees of these concepts known from the unconstrained setting do not extend to our constrained model. To address this limitation, we develop a mixed-integer linear program and other scalable heuristics that provide near-optimal approximation of Nash social welfare in simulated and real social commerce datasets. Overall, our work takes the first step towards achieving provable fairness alongside reasonable revenue guarantees on social commerce platforms.

Related papers

• Defection-Free Collaboration between Competitors in a Learning System [61.22540496065961]
  We study collaborative learning systems in which the participants are competitors who will defect from the system if they lose revenue by collaborating. We propose a more equitable, *defection-free* scheme in which both firms share with each other while losing no revenue.
  arXiv  Detail & Related papers  (2024-06-22T17:29:45Z)
• 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)
• Learning to Maximize Gains From Trade in Small Markets [6.204762177970342]
  We study the problem of designing a two-sided market (double auction) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our result is a general impossibility for the case of correlated distributions of values even between one seller and two buyers. Our second is an efficient learning algorithm for one seller and two buyers in the case of independent distributions.
  arXiv  Detail & Related papers  (2024-01-21T20:57:12Z)
• Seller-side Outcome Fairness in Online Marketplaces [8.29306513718005]
  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.
  arXiv  Detail & Related papers  (2023-12-06T02:58:49Z)
• DualFair: Fair Representation Learning at Both Group and Individual Levels via Contrastive Self-supervision [73.80009454050858]
  This work presents a self-supervised model, called DualFair, that can debias sensitive attributes like gender and race from learned representations. Our model jointly optimize for two fairness criteria - group fairness and counterfactual fairness.
  arXiv  Detail & Related papers  (2023-03-15T07:13:54Z)
• Parity in Markets -- Methods, Costs, and Consequences [109.5267969644294]
  We show how market designers can use taxes or subsidies in Fisher markets to ensure that market equilibrium outcomes fall within certain constraints. We adapt various types of fairness constraints proposed in existing literature to the market case and show who benefits and who loses from these constraints.
  arXiv  Detail & Related papers  (2022-10-05T22:27:44Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• 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)
• A Framework for Fairness in Two-Sided Marketplaces [7.178352722180915]
  We propose a definition and develop an end-to-end framework for achieving fairness while building machine learning systems at scale. We extend prior work to develop an optimization framework that can tackle fairness constraints from both the source and destination sides of the marketplace. The framework is flexible enough to adapt to different definitions of fairness and can be implemented in very large-scale settings.
  arXiv  Detail & Related papers  (2020-06-23T04:47:37Z)
• Individual Fairness in Advertising Auctions through Inverse Proportionality [12.861470300253329]
  We study the design of ad auctions that, given fair bids, are guaranteed to produce fair outcomes. We introduce a new class of allocation algorithms that achieve a tradeoff between fairness and social welfare.
  arXiv  Detail & Related papers  (2020-03-31T06:10:07Z)

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.