{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:19Z","timestamp":1775912959475,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CCF-211567"],"award-info":[{"award-number":["CCF-211567"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614877","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"2906-2916","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["FARA: Future-aware Ranking Algorithm for Fairness Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7282-2463","authenticated-orcid":false,"given":"Tao","family":"Yang","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2370-4487","authenticated-orcid":false,"given":"Zhichao","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1228-7080","authenticated-orcid":false,"given":"Zhenduo","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5030-709X","authenticated-orcid":false,"given":"Qingyao","family":"Ai","sequence":"additional","affiliation":[{"name":"DCST, Tsinghua University, Quan Cheng Laboratory, Zhongguancun Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209986"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_1_4_1","volume-title":"The 41st international acm sigir conference on research & development in information retrieval. 405--414.","author":"Biega Asia J","unstructured":"Asia J Biega , Krishna P Gummadi , and Gerhard Weikum . 2018. Equity of attention: Amortizing individual fairness in rankings . In The 41st international acm sigir conference on research & development in information retrieval. 405--414. Asia J Biega, Krishna P Gummadi, and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In The 41st international acm sigir conference on research & development in information retrieval. 405--414."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532680"},{"key":"e_1_3_2_1_6_1","volume-title":"Ranking with fairness constraints. arXiv preprint arXiv:1704.06840","author":"Celis L Elisa","year":"2017","unstructured":"L Elisa Celis , Damian Straszak , and Nisheeth K Vishnoi . 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 ( 2017 ). L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_1_9_1","volume-title":"Overview of the TREC 2022 Fair Ranking Track. arXiv preprint arXiv:2302","author":"Ekstrand Michael D","year":"2023","unstructured":"Michael D Ekstrand , Graham McDonald , Amifa Raj , and Isaac Johnson . 2023 . Overview of the TREC 2022 Fair Ranking Track. arXiv preprint arXiv:2302 .05558 (2023). Michael D Ekstrand, Graham McDonald, Amifa Raj, and Isaac Johnson. 2023. Overview of the TREC 2022 Fair Ranking Track. arXiv preprint arXiv:2302.05558 (2023)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.24648"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462807"},{"key":"e_1_3_2_1_12_1","volume-title":"Explainable Fairness in Recommendation. arXiv preprint arXiv:2204.11159","author":"Ge Yingqiang","year":"2022","unstructured":"Yingqiang Ge , Juntao Tan , Yan Zhu , Yinglong Xia , Jiebo Luo , Shuchang Liu , Zuohui Fu , Shijie Geng , Zelong Li , and Yongfeng Zhang . 2022. Explainable Fairness in Recommendation. arXiv preprint arXiv:2204.11159 ( 2022 ). Yingqiang Ge, Juntao Tan, Yan Zhu, Yinglong Xia, Jiebo Luo, Shuchang Liu, Zuohui Fu, Shijie Geng, Zelong Li, and Yongfeng Zhang. 2022. Explainable Fairness in Recommendation. arXiv preprint arXiv:2204.11159 (2022)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330691"},{"key":"e_1_3_2_1_14_1","volume-title":"George P\u00f3lya, Gy\u00f6rgy P\u00f3lya, et al.","author":"Hardy Godfrey Harold","year":"1952","unstructured":"Godfrey Harold Hardy , John Edensor Littlewood , George P\u00f3lya, Gy\u00f6rgy P\u00f3lya, et al. 1952 . Inequalities. Cambridge university press . Godfrey Harold Hardy, John Edensor Littlewood, George P\u00f3lya, Gy\u00f6rgy P\u00f3lya, et al. 1952. Inequalities. Cambridge university press."},{"key":"e_1_3_2_1_15_1","volume-title":"Fairness of Exposure in Light of Incomplete Exposure Estimation. arXiv preprint arXiv:2205.12901","author":"Heuss Maria","year":"2022","unstructured":"Maria Heuss , Fatemeh Sarvi , and Maarten de Rijke . 2022. Fairness of Exposure in Light of Incomplete Exposure Estimation. arXiv preprint arXiv:2205.12901 ( 2022 ). Maria Heuss, Fatemeh Sarvi, and Maarten de Rijke. 2022. Fairness of Exposure in Light of Incomplete Exposure Estimation. arXiv preprint arXiv:2205.12901 (2022)."},{"key":"e_1_3_2_1_16_1","volume-title":"ACM Transactions on Information Systems (TOIS)","volume":"20","author":"Jaana Kalervo","year":"2002","unstructured":"Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002 . Cumulated gain-based evaluation of IR techniques . ACM Transactions on Information Systems (TOIS) , Vol. 20 , 4 (2002), 422--446. Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS), Vol. 20, 4 (2002), 422--446."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472226"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512247"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462966"},{"key":"e_1_3_2_1_21_1","volume-title":"Foundations and Trends\u00ae in Information Retrieval","volume":"3","author":"Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu et al. 2009. Learning to rank for information retrieval . Foundations and Trends\u00ae in Information Retrieval , Vol. 3 , 3 ( 2009 ), 225--331. Tie-Yan Liu et al. 2009. Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval, Vol. 3, 3 (2009), 225--331."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914763"},{"key":"e_1_3_2_1_23_1","volume-title":"Understanding and mitigating multi-sided exposure bias in recommender systems. ACM SIGWEB Newsletter Autumn","author":"Mansoury Masoud","year":"2022","unstructured":"Masoud Mansoury . 2022. Understanding and mitigating multi-sided exposure bias in recommender systems. ACM SIGWEB Newsletter Autumn ( 2022 ), 1--4. Masoud Mansoury. 2022. Understanding and mitigating multi-sided exposure bias in recommender systems. ACM SIGWEB Newsletter Autumn (2022), 1--4."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_1_25_1","volume-title":"Cpfair: Personalized consumer and producer fairness re-ranking for recommender systems. arXiv preprint arXiv:2204.08085","author":"Naghiaei Mohammadmehdi","year":"2022","unstructured":"Mohammadmehdi Naghiaei , Hossein A Rahmani , and Yashar Deldjoo . 2022 . Cpfair: Personalized consumer and producer fairness re-ranking for recommender systems. arXiv preprint arXiv:2204.08085 (2022). Mohammadmehdi Naghiaei, Hossein A Rahmani, and Yashar Deldjoo. 2022. Cpfair: Personalized consumer and producer fairness re-ranking for recommender systems. arXiv preprint arXiv:2204.08085 (2022)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441794"},{"key":"e_1_3_2_1_29_1","volume-title":"Fair ranking: a critical review, challenges, and future directions. arXiv preprint arXiv:2201.12662","author":"Patro Gourab K","year":"2022","unstructured":"Gourab K Patro , Lorenzo Porcaro , Laura Mitchell , Qiuyue Zhang , Meike Zehlike , and Nikhil Garg . 2022. Fair ranking: a critical review, challenges, and future directions. arXiv preprint arXiv:2201.12662 ( 2022 ). Gourab K Patro, Lorenzo Porcaro, Laura Mitchell, Qiuyue Zhang, Meike Zehlike, and Nikhil Garg. 2022. Fair ranking: a critical review, challenges, and future directions. arXiv preprint arXiv:2201.12662 (2022)."},{"key":"e_1_3_2_1_30_1","volume-title":"arXiv preprint arXiv:1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu . 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 ( 2013 ). Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the national conference on artificial intelligence","volume":"21","author":"Radlinski Filip","year":"2006","unstructured":"Filip Radlinski and Thorsten Joachims . 2006 . Minimally invasive randomization for collecting unbiased preferences from clickthrough logs . In Proceedings of the national conference on artificial intelligence , Vol. 21 . Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 1406. Filip Radlinski and Thorsten Joachims. 2006. Minimally invasive randomization for collecting unbiased preferences from clickthrough logs. In Proceedings of the national conference on artificial intelligence, Vol. 21. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 1406."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532018"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_34_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_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539353"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_38_1","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. In Advances in Neural Information Processing Systems. 5426--5436.  Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. In Advances in Neural Information Processing Systems. 5426--5436."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321528"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482020"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3534633"},{"key":"e_1_3_2_1_42_1","volume-title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking. arXiv preprint arXiv:2204.13765","author":"Vardasbi Ali","year":"2022","unstructured":"Ali Vardasbi , Fatemeh Sarvi , and Maarten de Rijke . 2022. Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking. arXiv preprint arXiv:2204.13765 ( 2022 ). Ali Vardasbi, Fatemeh Sarvi, and Maarten de Rijke. 2022. Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking. arXiv preprint arXiv:2204.13765 (2022)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331264"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210045"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532007"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462882"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449901"},{"key":"e_1_3_2_1_49_1","volume-title":"2023 a. Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach. arXiv preprint arXiv:2305.16606","author":"Yang Tao","year":"2023","unstructured":"Tao Yang , Cuize Han , Chen Luo , Parth Gupta , Jeff M Phillips , and Qingyao Ai . 2023 a. Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach. arXiv preprint arXiv:2305.16606 ( 2023 ). Tao Yang, Cuize Han, Chen Luo, Parth Gupta, Jeff M Phillips, and Qingyao Ai. 2023 a. Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach. arXiv preprint arXiv:2305.16606 (2023)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531948"},{"key":"e_1_3_2_1_51_1","volume-title":"Effective Exposure Amortizing for Fair Top-k Recommendation. arXiv preprint arXiv:2204.03046","author":"Yang Tao","year":"2022","unstructured":"Tao Yang , Zhichao Xu , and Qingyao Ai. 2022b. Effective Exposure Amortizing for Fair Top-k Recommendation. arXiv preprint arXiv:2204.03046 ( 2022 ). Tao Yang, Zhichao Xu, and Qingyao Ai. 2022b. Effective Exposure Amortizing for Fair Top-k Recommendation. arXiv preprint arXiv:2204.03046 (2022)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570474"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"},{"key":"e_1_3_2_1_55_1","volume-title":"Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000","author":"Zehlike Meike","year":"2021","unstructured":"Meike Zehlike , Ke Yang , and Julia Stoyanovich . 2021. Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000 ( 2021 ). Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2021. Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000 (2021)."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614877","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:57Z","timestamp":1750178217000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":54,"alternative-id":["10.1145\/3583780.3614877","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614877","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}