{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T05:22:24Z","timestamp":1784092944569,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3532007","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:08Z","timestamp":1657206728000},"page":"703-714","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Joint Multisided Exposure Fairness for Recommendation"],"prefix":"10.1145","author":[{"given":"Haolun","family":"Wu","sequence":"first","affiliation":[{"name":"McGill University, Montr\u00e9al, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaskar","family":"Mitra","sequence":"additional","affiliation":[{"name":"Microsoft, Montr\u00e9al, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Ma","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong SAR, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fernando","family":"Diaz","sequence":"additional","affiliation":[{"name":"Canadian CIFAR AI Chair & Google, Montr\u00e9al, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xue","family":"Liu","sequence":"additional","affiliation":[{"name":"McGill University, Montr\u00e9al, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/rfs\/hhr059"},{"key":"e_1_3_2_2_2_1","volume-title":"Race after technology: Abolitionist tools for the new jim code. Social Forces","author":"Benjamin Ruha","year":"2019","unstructured":"Ruha Benjamin . 2019. Race after technology: Abolitionist tools for the new jim code. Social Forces ( 2019 ). Ruha Benjamin. 2019. Race after technology: Abolitionist tools for the new jim code. Social Forces (2019)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_2_5_1","volume-title":"Hamilton","author":"Bose Avishek Joey","year":"2019","unstructured":"Avishek Joey Bose and William L . Hamilton . 2019 . Compositional Fairness Constraints for Graph Embeddings. In ICML (Proceedings of Machine Learning Research , Vol. 97). PMLR, 715-- 724 . Avishek Joey Bose and William L. Hamilton. 2019. Compositional Fairness Constraints for Graph Embeddings. In ICML (Proceedings of Machine Learning Research, Vol. 97). PMLR, 715--724."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371844"},{"key":"e_1_3_2_2_7_1","volume-title":"Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093","author":"Burke Robin","year":"2017","unstructured":"Robin Burke . 2017. Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093 ( 2017 ). Robin Burke. 2017. Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093 (2017)."},{"key":"e_1_3_2_2_8_1","volume-title":"Conference on Fairness, Accountability and Transparency. 202--214","author":"Burke Robin","year":"2018","unstructured":"Robin Burke , Nasim Sonboli , and Aldo Ordonez-Gauger . 2018 . Balanced neighborhoods for multi-sided fairness in recommendation . In Conference on Fairness, Accountability and Transparency. 202--214 . Robin Burke, Nasim Sonboli, and Aldo Ordonez-Gauger. 2018. Balanced neighborhoods for multi-sided fairness in recommendation. In Conference on Fairness, Accountability and Transparency. 202--214."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-02294-4"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484071"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210141"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462951"},{"key":"e_1_3_2_2_13_1","unstructured":"Patricia Hill Collins and Sirma Bilge. 2020. Intersectionality. John Wiley & Sons.  Patricia Hill Collins and Sirma Bilge. 2020. Intersectionality. John Wiley & Sons."},{"key":"e_1_3_2_2_14_1","volume-title":"Conference on Neural Information Processing Systems, invited speaker.","author":"Crawford Kate","year":"2017","unstructured":"Kate Crawford . 2017 . The trouble with bias . In Conference on Neural Information Processing Systems, invited speaker. Kate Crawford. 2017. The trouble with bias. In Conference on Neural Information Processing Systems, invited speaker."},{"key":"e_1_3_2_2_15_1","volume-title":"On intersectionality: Essential writings","author":"Crenshaw Kimberl\u00e9 W","unstructured":"Kimberl\u00e9 W Crenshaw . 2017. On intersectionality: Essential writings . The New Press . Kimberl\u00e9 W Crenshaw. 2017. On intersectionality: Essential writings. The New Press."},{"key":"e_1_3_2_2_16_1","volume-title":"The history of the gender wage gap in America. Investopedia","author":"Daugherty Greg","year":"2021","unstructured":"Greg Daugherty . 2021. The history of the gender wage gap in America. Investopedia ( 2021 ). https:\/\/www.investopedia.com\/history-gender-wage-gap-america-5074898 Greg Daugherty. 2021. The history of the gender wage gap in America. Investopedia (2021). https:\/\/www.investopedia.com\/history-gender-wage-gap-america-5074898"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_2_18_1","volume-title":"Fairness and Discrimination in Information Access Systems. arXiv preprint arXiv:2105.05779","author":"Ekstrand Michael D","year":"2021","unstructured":"Michael D Ekstrand , Anubrata Das , Robin Burke , and Fernando Diaz . 2021. Fairness and Discrimination in Information Access Systems. arXiv preprint arXiv:2105.05779 ( 2021 ). Michael D Ekstrand, Anubrata Das, Robin Burke, and Fernando Diaz. 2021. Fairness and Discrimination in Information Access Systems. arXiv preprint arXiv:2105.05779 (2021)."},{"key":"e_1_3_2_2_19_1","volume-title":"Conference on fairness, accountability and transparency. PMLR, 172--186","author":"Ekstrand Michael D","year":"2018","unstructured":"Michael D Ekstrand , Mucun Tian , Ion Madrazo Azpiazu , Jennifer D Ekstrand , Oghenemaro Anuyah , David McNeill , and Maria Soledad Pera . 2018 . All the cool kids, how do they fit in?: Popularity and demographic biases in recommender evaluation and effectiveness . In Conference on fairness, accountability and transparency. PMLR, 172--186 . Michael D Ekstrand, Mucun Tian, Ion Madrazo Azpiazu, Jennifer D Ekstrand, Oghenemaro Anuyah, David McNeill, and Maria Soledad Pera. 2018. All the cool kids, how do they fit in?: Popularity and demographic biases in recommender evaluation and effectiveness. In Conference on fairness, accountability and transparency. PMLR, 172--186."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/230538.230561"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531973"},{"key":"e_1_3_2_2_22_1","volume-title":"AISTATS (JMLR Proceedings","volume":"256","author":"Glorot Xavier","year":"2010","unstructured":"Xavier Glorot and Yoshua Bengio . 2010 . Understanding the difficulty of training deep feedforward neural networks . In AISTATS (JMLR Proceedings , Vol. 9). JMLR.org, 249-- 256 . Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In AISTATS (JMLR Proceedings, Vol. 9). JMLR.org, 249--256."},{"key":"e_1_3_2_2_23_1","article-title":"The MovieLens Datasets","volume":"5","author":"Maxwell Harper F.","year":"2016","unstructured":"F. Maxwell Harper and Joseph A. Konstan . 2016 . The MovieLens Datasets : History and Context. ACM Trans. Interact. Intell. Syst. , Vol. 5 , 4 (2016), 19:1--19:19. F. Maxwell Harper and Joseph A. Konstan. 2016. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst., Vol. 5, 4 (2016), 19:1--19:19.","journal-title":"History and Context. ACM Trans. Interact. Intell. Syst."},{"key":"e_1_3_2_2_24_1","volume-title":"Collaborative Filtering for Implicit Feedback Datasets","author":"Hu Yifan","unstructured":"Yifan Hu , Yehuda Koren , and Chris Volinsky . 2008. Collaborative Filtering for Implicit Feedback Datasets . In ICDM. IEEE Computer Society , 263--272. Yifan Hu, Yehuda Koren, and Chris Volinsky. 2008. Collaborative Filtering for Implicit Feedback Datasets. In ICDM. IEEE Computer Society, 263--272."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Adith Swaminathan and Tobias Schnabel. 2018. Unbiased Learning-to-Rank with Biased Feedback. In IJCAI. ijcai.org 5284--5288.  Thorsten Joachims Adith Swaminathan and Tobias Schnabel. 2018. Unbiased Learning-to-Rank with Biased Feedback. In IJCAI. ijcai.org 5284--5288.","DOI":"10.24963\/ijcai.2018\/738"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702520"},{"key":"e_1_3_2_2_28_1","unstructured":"Maurice George Kendall. 1948. Rank correlation methods. (1948).  Maurice George Kendall. 1948. Rank correlation methods. (1948)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Xiao Lin Min Zhang Yongfeng Zhang Zhaoquan Gu Yiqun Liu and Shaoping Ma. 2017. Fairness-Aware Group Recommendation with Pareto-Efficiency. In RecSys. ACM 107--115.  Xiao Lin Min Zhang Yongfeng Zhang Zhaoquan Gu Yiqun Liu and Shaoping Ma. 2017. Fairness-Aware Group Recommendation with Pareto-Efficiency. In RecSys. ACM 107--115.","DOI":"10.1145\/3109859.3109887"},{"key":"e_1_3_2_2_30_1","unstructured":"Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011).  Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011)."},{"key":"e_1_3_2_2_31_1","unstructured":"R.Duncan Luce. [n.d.]. The choice axiom after twenty years. Journal of Mathematical Psychology ([n. d.]).  R.Duncan Luce. [n.d.]. The choice axiom after twenty years. Journal of Mathematical Psychology ([n. d.])."},{"key":"e_1_3_2_2_32_1","volume-title":"Individual Choice Behavior: A Theoretical analysis","author":"Luce R. Duncan","unstructured":"R. Duncan Luce . 1959. Individual Choice Behavior: A Theoretical analysis . Wiley , New York, NY, USA . R. Duncan Luce. 1959. Individual Choice Behavior: A Theoretical analysis. Wiley, New York, NY, USA."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054197"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Rishabh Mehrotra James McInerney Hugues Bouchard Mounia Lalmas and Fernando Diaz. 2018. Towards a Fair Marketplace: Counterfactual Evaluation of the trade-off between Relevance Fairness & Satisfaction in Recommendation Systems. In CIKM. ACM 2243--2251.  Rishabh Mehrotra James McInerney Hugues Bouchard Mounia Lalmas and Fernando Diaz. 2018. Towards a Fair Marketplace: Counterfactual Evaluation of the trade-off between Relevance Fairness & Satisfaction in Recommendation Systems. In CIKM. ACM 2243--2251.","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99736-6_43"},{"key":"e_1_3_2_2_38_1","volume-title":"SLIM: Sparse Linear Methods for Top-N Recommender Systems","author":"Ning Xia","year":"2011","unstructured":"Xia Ning and George Karypis . 2011 . SLIM: Sparse Linear Methods for Top-N Recommender Systems . In ICDM. IEEE Computer Society , 497--506. Xia Ning and George Karypis. 2011. SLIM: Sparse Linear Methods for Top-N Recommender Systems. In ICDM. IEEE Computer Society, 497--506."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Harrie Oosterhuis and Maarten de Rijke. 2020. Policy-Aware Unbiased Learning to Rank for Top-k Rankings. In SIGIR. ACM 489--498.  Harrie Oosterhuis and Maarten de Rijke. 2020. Policy-Aware Unbiased Learning to Rank for Top-k Rankings. In SIGIR. ACM 489--498.","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_2_2_41_1","unstructured":"Sandeep Pandey Sourashis Roy Christopher Olston Junghoo Cho and Soumen Chakrabarti. 2005. Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results. In VLDB. ACM 781--792.  Sandeep Pandey Sourashis Roy Christopher Olston Junghoo Cho and Soumen Chakrabarti. 2005. Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results. In VLDB. ACM 781--792."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Gourab K. Patro Arpita Biswas Niloy Ganguly Krishna P. Gummadi and Abhijnan Chakraborty. 2020. FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms. In WWW. ACM \/ IW3C2 1194--1204.  Gourab K. Patro Arpita Biswas Niloy Ganguly Krishna P. Gummadi and Abhijnan Chakraborty. 2020. FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms. In WWW. ACM \/ IW3C2 1194--1204.","DOI":"10.1145\/3366423.3380196"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_2_44_1","volume-title":"A general approximation framework for direct optimization of information retrieval measures. Information retrieval","author":"Qin Tao","year":"2010","unstructured":"Tao Qin , Tie-Yan Liu , and Hang Li. 2010. A general approximation framework for direct optimization of information retrieval measures. Information retrieval , Vol. 13 , 4 ( 2010 ), 375--397. Tao Qin, Tie-Yan Liu, and Hang Li. 2010. A general approximation framework for direct optimization of information retrieval measures. Information retrieval, Vol. 13, 4 (2010), 375--397."},{"key":"e_1_3_2_2_45_1","volume-title":"Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs. CoRR","author":"Radlinski Filip","year":"2006","unstructured":"Filip Radlinski and Thorsten Joachims . 2006. Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs. CoRR , Vol. abs\/cs\/ 0605037 ( 2006 ). Filip Radlinski and Thorsten Joachims. 2006. Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs. CoRR, Vol. abs\/cs\/0605037 (2006)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Filip Radlinski and Thorsten Joachims. 2007. Active exploration for learning rankings from clickthrough data. In KDD. ACM 570--579.  Filip Radlinski and Thorsten Joachims. 2007. Active exploration for learning rankings from clickthrough data. In KDD. ACM 570--579.","DOI":"10.1145\/1281192.1281254"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_2_48_1","volume-title":"Societal Biases in Retrieved Contents: Measurement Framework and Adversarial Mitigation for BERT Rankers. arXiv preprint arXiv:2104.13640","author":"Rekabsaz Navid","year":"2021","unstructured":"Navid Rekabsaz , Simone Kopeinik , and Markus Schedl . 2021. Societal Biases in Retrieved Contents: Measurement Framework and Adversarial Mitigation for BERT Rankers. arXiv preprint arXiv:2104.13640 ( 2021 ). Navid Rekabsaz, Simone Kopeinik, and Markus Schedl. 2021. Societal Biases in Retrieved Contents: Measurement Framework and Adversarial Mitigation for BERT Rankers. arXiv preprint arXiv:2104.13640 (2021)."},{"key":"e_1_3_2_2_49_1","volume-title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle , Christoph Freudenthaler , Zeno Gantner , and Lars Schmidt-Thieme . 2009 . BPR: Bayesian Personalized Ranking from Implicit Feedback . In UAI. AUAI Press , 452--461. Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. AUAI Press, 452--461."},{"key":"e_1_3_2_2_50_1","volume-title":"The probability ranking principle in IR. Journal of documentation","author":"Robertson Stephen E","year":"1977","unstructured":"Stephen E Robertson . 1977. The probability ranking principle in IR. Journal of documentation ( 1977 ). Stephen E Robertson. 1977. The probability ranking principle in IR. Journal of documentation (1977)."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In KDD. ACM 2219--2228.  Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In KDD. ACM 2219--2228.","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_2_52_1","volume-title":"Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. dtextquotesingle Alch\u00e9-Buc","author":"Singh Ashudeep","unstructured":"Ashudeep Singh and Thorsten Joachims . 2019. Policy Learning for Fairness in Ranking . In Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. dtextquotesingle Alch\u00e9-Buc , E. Fox, and R. Garnett (Eds.). Curran Associates, Inc. , 5427--5437. Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. dtextquotesingle Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.). Curran Associates, Inc., 5427--5437."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330793"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2447976.2447990"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577091"},{"key":"e_1_3_2_2_56_1","volume-title":"Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474","author":"Tzeng Eric","year":"2014","unstructured":"Eric Tzeng , Judy Hoffman , Ning Zhang , Kate Saenko , and Trevor Darrell . 2014. Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474 ( 2014 ). Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. 2014. Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474 (2014)."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Michael Bendersky Donald Metzler and Marc Najork. 2016. Learning to Rank with Selection Bias in Personal Search. In SIGIR. ACM 115--124.  Xuanhui Wang Michael Bendersky Donald Metzler and Marc Najork. 2016. Learning to Rank with Selection Bias in Personal Search. In SIGIR. ACM 115--124.","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_2_58_1","volume-title":"Wage gaps by race. Investopedia","author":"Williams Ward","year":"2021","unstructured":"Ward Williams . 2021. Wage gaps by race. Investopedia ( 2021 ). https:\/\/www.investopedia.com\/wage-gaps-by-race-5073258 Ward Williams. 2021. Wage gaps by race. Investopedia (2021). https:\/\/www.investopedia.com\/wage-gaps-by-race-5073258"},{"key":"e_1_3_2_2_59_1","unstructured":"Chuhan Wu Fangzhao Wu Xiting Wang Yongfeng Huang and Xing Xie. 2021 b. Fairrec: fairness-aware news recommendation with decomposed adversarial learning. AAAI.  Chuhan Wu Fangzhao Wu Xiting Wang Yongfeng Huang and Xing Xie. 2021 b. Fairrec: fairness-aware news recommendation with decomposed adversarial learning. AAAI."},{"key":"e_1_3_2_2_60_1","unstructured":"Haolun Wu Chen Ma Bhaskar Mitra Fernando Diaz and Xue Liu. 2021 a. Multi-FR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation. arxiv: 2105.02951 [cs.IR]  Haolun Wu Chen Ma Bhaskar Mitra Fernando Diaz and Xue Liu. 2021 a. Multi-FR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation. arxiv: 2105.02951 [cs.IR]"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646266"},{"key":"e_1_3_2_2_62_1","volume-title":"Policy-Gradient Training of Fair and Unbiased Ranking Functions. arXiv preprint arXiv:1911.08054","author":"Yadav Himank","year":"2019","unstructured":"Himank Yadav , Zhengxiao Du , and Thorsten Joachims . 2019. Policy-Gradient Training of Fair and Unbiased Ranking Functions. arXiv preprint arXiv:1911.08054 ( 2019 ). Himank Yadav, Zhengxiao Du, and Thorsten Joachims. 2019. Policy-Gradient Training of Fair and Unbiased Ranking Functions. arXiv preprint arXiv:1911.08054 (2019)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871672"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Meike Zehlike Francesco Bonchi Carlos Castillo Sara Hajian Mohamed Megahed and Ricardo Baeza-Yates. 2017. FA*IR: A Fair Top-k Ranking Algorithm. In CIKM. ACM 1569--1578.  Meike Zehlike Francesco Bonchi Carlos Castillo Sara Hajian Mohamed Megahed and Ricardo Baeza-Yates. 2017. FA*IR: A Fair Top-k Ranking Algorithm. In CIKM. ACM 1569--1578.","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278721.3278779"}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Madrid Spain","acronym":"SIGIR '22","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3532007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:20Z","timestamp":1750183820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":65,"alternative-id":["10.1145\/3477495.3532007","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3532007","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}