Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms

Running FairRec or FairRecPlus

python FairRec.py google_local_fact.csv 10 0.5
python FairRecPlus.py google_local_fact.csv 10 0.5

There are three arguments here.

• path to csv file with relevance scores (rows: customers, columns: producers) like google_local_fact.csv above.
  
• size of recommendation or k like 10 above.
  
• value of α (our producer-side guarantee will be α×MMS. The value of α can be in between 0 and 1) like 0.5 above.

It saves the recommendations in zipped pickle file (dictionary format { customer : list_of_recommended_products }).

Relevance Scores

You can use the relevance scores estimated in your dataset in csv format (rows: customers, columns: producers) for your application scenario. Alternatively you can test with ours. The relevance scores calculated for the datasets (used in the paper) can be found in the following links in zipped csv format.

• GL-CUSTOM : Custom relevance function on Google Local ratings data.
• GL-FACT : Relevance scores from latent embedding based factorization on Google Local ratings data.
• LF : Relevance scores from latent embedding based factorization on Last.fm data.

Citation Information

If you use this repository in your research, please cite the following papers.

• FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms.
  Gourab K Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi and Abhijnan Chakraborty.
  In proceedings of The Web Conference (WWW), Taipei, Taiwan, April 2020.
  
• Toward Fair Recommendation in Two-sided Platforms.
  Gourab K Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi and Abhijnan Chakraborty.
  ACM Transactions on the Web (TWEB). 2021 Dec 21;16(2):1-34.
  

You can use the following bibtex.

@inproceedings{10.1145/3366423.3380196,
author = {Patro, Gourab K and Biswas, Arpita and Ganguly, Niloy and Gummadi, Krishna P. and Chakraborty, Abhijnan},
title = {FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms},
year = {2020},
isbn = {9781450370233},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3366423.3380196},
doi = {10.1145/3366423.3380196},
booktitle = {Proceedings of The Web Conference 2020},
pages = {1194–1204},
numpages = {11},
keywords = {Fair Allocation, Fair Recommendation, Maximin Share, Two-Sided Markets, Envy-Freeness},
location = {Taipei, Taiwan},
series = {WWW ’20}
}

@article{biswas2021toward,
  title={Toward Fair Recommendation in Two-sided Platforms},
  author={Biswas, Arpita and Patro, Gourab K and Ganguly, Niloy and Gummadi, Krishna P and Chakraborty, Abhijnan},
  journal={ACM Transactions on the Web (TWEB)},
  volume={16},
  number={2},
  pages={1--34},
  year={2021},
  publisher={ACM New York, NY}
}