Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Fair Allocation in Social Commerce Platforms (2402.12759v1)

Published 20 Feb 2024 in cs.CY and cs.SI

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (55)
  1. Himan Abdollahpouri and Robin Burke. 2019. Multi-stakeholder Recommendation and its Connection to Multi-sided Fairness. In RMSE 2019.
  2. Fair Division of Indivisible Goods: A Survey.
  3. Nina Angelovska. 2018. 6 Reasons Why Europeans Don’t Shop Online. https://www.forbes.com/sites/ninaangelovska/2018/10/23/6-reasons-why-europeans-dont-shop-online/?sh=10fb6bb22869.
  4. Fair Allocation of Indivisible Goods and Chores. In Proc. IJCAI.
  5. Finding Fair and Efficient Allocations. In Proc. of EC. 557–574.
  6. Tarush Bhalla. 2020. Social commerce firms focus on local tongue. https://www.livemint.com/technology/tech-news/social-commerce-firms-focus-on-local-tongue-11596811490216.html.
  7. Arpita Biswas and Siddharth Barman. 2018. Fair Division under Cardinality Constraints. In Proc. IJCAI.
  8. DeepFair: Deep Learning for Improving Fairness in Recommender Systems. CoRR abs/2006.05255 (2020). arXiv:2006.05255
  9. Fair Division of a Graph. arXiv:1705.10239 [cs.GT]
  10. Eric Budish. 2010. The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. In BQGT.
  11. The Unreasonable Fairness of Maximum Nash Welfare. ACM Transactions on Economics and Computation 7 (09 2019), 1–32.
  12. Fair Sharing for Sharing Economy Platforms. In Proc. FATREC.
  13. Fair Division of Indivisible Goods for a Class of Concave Valuations. Journal of Artificial Intelligence Research 74 (05 2022), 111–142.
  14. An enhanced social matrix factorization model for recommendation based on social networks using social interaction factors. Multimedia Tools and Applications 79 (05 2020), 1–31.
  15. Scalable Influence Maximization in Social Networks under the Linear Threshold Model. Proc. ICDM, 88–97.
  16. Two-Sided Matching Meets Fair Division. In Proc. IJCAI, Zhi-Hua Zhou (Ed.). 203–209.
  17. Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation.
  18. Equitable Allocations of Indivisible Goods.
  19. Item Recommendation for Word-of-Mouth Scenario in Social E-Commerce. IEEE Transactions on Knowledge and Data Engineering (2020).
  20. Joseph L Gastwirth. 1972. The estimation of the Lorenz curve and Gini index. The review of economics and statistics (1972), 306–316.
  21. Toward Pareto Efficient Fairness-Utility Trade-off in Recommendation through Reinforcement Learning. In Proc. WSDM. 316–324.
  22. Almost Envy-Free Repeated Matching In Two-Sided Markets. In WINE (Beijing, China). Springer-Verlag, Berlin, Heidelberg, 3–16.
  23. Near Fairness in Matroids. In Proc. ECAI. 393–398.
  24. SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. Proc. ICDM, 211–220.
  25. Pareto Optimality for Fairness-Constrained Collaborative Filtering. In Proc. ACM International Conference on Multimedia. 5619–5627.
  26. Juris Hartmanis. 1982. Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson). SIAM Rev. 24, 1 (1982), 90–91.
  27. Collaborative Filtering for Implicit Feedback Datasets. In Proc. ICDM. 263–272.
  28. Debiasing Career Recommendations with Neural Fair Collaborative Filtering. In Proc. WWW. 3779–3790.
  29. Christopher C. Johnson. 2014. Logistic Matrix Factorization for Implicit Feedback Data.
  30. IRIE: Scalable and Robust Influence Maximization in Social Networks. Proc. ICDM (11 2011).
  31. Practice Prize Winner—Creating a Measurable Social Media Marketing Strategy: Increasing the Value and ROI of Intangibles and Tangibles for Hokey Pokey. Marketing Science 32 (03 2013), 194–212.
  32. Euiwoong Lee. 2017. APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. Inform. Process. Lett. 122 (2017), 17–20.
  33. Cost-effective outbreak detection in networks. Proc. SIGKDD 420-429, 420–429.
  34. Balancing Efficiency and Fairness in On-Demand Ridesourcing. In Proc. NeurIPS, Vol. 32.
  35. Cross: Cross-platform recommendation for social e-commerce. In Proc. SIGIR. 515–524.
  36. Social recommendation with self-supervised metagraph informax network. In Proc. CIKM. 1160–1169.
  37. SoRec: Social Recommendation Using Probabilistic Matrix Factorization. In Proc. CIKM. 931–940.
  38. Masoud Mansoury. 2021. Fairness-Aware Recommendation in Multi-Sided Platforms. In Proc. WSDM. 1117–1118.
  39. Improved the performance of the K-means cluster using the sum of squared error (SSE) optimized by using the Elbow method. In Journal of Physics: Conference Series, Vol. 1361.
  40. Trung Thanh Nguyen et al. 2022. An Experimental Study of Fast Greedy Algorithms for Fair Allocation Problems. Journal on Information Technologies & Communications 2022, 2 (2022), 71–81.
  41. Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. Proceedings of the National Conference on Artificial Intelligence 1 (01 2014), 138–144.
  42. FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms. In Proc. WWW (Taipei, Taiwan) (WWW ’20). 1194–1204.
  43. Erel Segal-Halevi. 2019. Fair division with bounded sharing. arXiv preprint arXiv:1912.00459 (2019).
  44. Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. CoRR abs/1802.07281 (2018). arXiv:1802.07281
  45. Manish Singh. 2021. Indian social commerce Meesho raises $570 million at $4.9 billion valuation. https://techcrunch.com/2021/09/29/meesho-india-social-commerce-raises-570-million/.
  46. strategicmarketresearch. 2022. Social Commerce Market Size, Share, Global Report 2030. https://www.strategicmarketresearch.com/market-report/social-commerce-market.
  47. Two-sided fairness for repeated matchings in two-sided markets: A case study of a ride-hailing platform. In Proc. KDD.
  48. Influence Maximization in Near-Linear Time: A Martingale Approach. In Proc. SIGMOD. 1539–1554.
  49. Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency. arXiv:1404.0900 [cs.SI]
  50. Multi-FR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation.
  51. Joint Multisided Exposure Fairness for Recommendation. In Proc. SIGIR.
  52. TFROM: A Two-Sided Fairness-Aware Recommendation Model for Both Customers and Providers. In Proc. SIGIR. 1013–1022.
  53. Fairness-Aware Group Recommendation with Pareto-Efficiency. In Proc. RecSys (Como, Italy) (RecSys ’17). 107–115.
  54. Relation-aware graph convolutional networks for agent-initiated social e-commerce recommendation. In Proc. CIKM. 529–538.
  55. Global context enhanced social recommendation with hierarchical graph neural networks. In Proc. ICDM. IEEE, 701–710.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now