{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:05:18Z","timestamp":1755907518027,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2023\/002896"],"award-info":[{"award-number":["CRG\/2023\/002896"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Walmart CSR","award":["WMGT-23-0001"],"award-info":[{"award-number":["WMGT-23-0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"DOI":"10.1145\/3626772.3657751","type":"proceedings-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:40:05Z","timestamp":1720701605000},"page":"1525-1534","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Learning-to-Rank Models for Ex-Post Fair Relevance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0179-9905","authenticated-orcid":false,"given":"Sruthi","family":"Gorantla","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4761-3930","authenticated-orcid":false,"given":"Eshaan","family":"Bhansali","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, Wisconsin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8638-1120","authenticated-orcid":false,"given":"Amit","family":"Deshpande","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4727-9219","authenticated-orcid":false,"given":"Anand","family":"Louis","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4076(81)90056-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371844"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331347"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_7_1","unstructured":"Chris J.C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report MSR-TR-2010--82. Microsoft Research. https:\/\/www.microsoft.com\/en-us\/research\/publication\/from-ranknet-to-lambdarank-to-lambdamart-an-overview\/"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308774.3308783"},{"volume-title":"Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency. 369--380","author":"Celis L. Elisa","key":"e_1_3_2_1_10_1","unstructured":"L. Elisa Celis, Anay Mehrotra, and Nisheeth K. Vishnoi. 2020. Interventions for Ranking in the Presence of Implicit Bias. In Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency. 369--380."},{"key":"e_1_3_2_1_11_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018. Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming, (ICALP) (LIPIcs), Vol. 107. 28:1--28:15."},{"key":"e_1_3_2_1_12_1","volume-title":"Garnett (Eds.)","volume":"30","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In Advances in Neural Information Processing Systems, I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/978fce5bcc4eccc88ad48ce3914124a2-Paper.pdf"},{"key":"e_1_3_2_1_13_1","volume-title":"Christopher De Sa, and Siddhartha Sen","author":"Cooper A. Feder","year":"2023","unstructured":"A. Feder Cooper, Solon Barocas, Christopher De Sa, and Siddhartha Sen. 2023. Variance, Self-Consistency, and Arbitrariness in Fair Classification. arxiv: cs.LG\/2301.11562"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Chris Ding and Xiaofeng He. 2004. K-Means Clustering via Principal Component Analysis. In ICML.","DOI":"10.1145\/1015330.1015408"},{"key":"e_1_3_2_1_16_1","unstructured":"Federal Financial Institutions Examination Council. 2017. HMDA Data Publication. https:\/\/www.consumerfinance.gov\/data-research\/hmda\/historic-data\/ Released due to the Home Mortgage Disclosure Act."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102138"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330691"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research), Marina Meila and Tong Zhang (Eds.)","volume":"139","author":"Gorantla Sruthi","year":"2021","unstructured":"Sruthi Gorantla, Amit Deshpande, and Anand Louis. 2021. On the Problem of Underranking in Group-Fair Ranking. In Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research), Marina Meila and Tong Zhang (Eds.), Vol. 139. PMLR, 3777--3787. https:\/\/proceedings.mlr.press\/v139\/gorantla21a.html"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/46"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-BA410"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.02.002"},{"key":"e_1_3_2_1_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.","journal-title":"History and Context. ACM Trans. Interact. Intell. Syst."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.24432\/C5NC77"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"volume-title":"Individual Choice Behavior: A Theoretical analysis","author":"Luce R. Duncan","key":"e_1_3_2_1_27_1","unstructured":"R. Duncan Luce. 1959. Individual Choice Behavior: A Theoretical analysis. Wiley."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599482"},{"volume-title":"SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1023--1032.","author":"Oosterhuis Harrie","key":"e_1_3_2_1_29_1","unstructured":"Harrie Oosterhuis. 2021. Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness. In SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1023--1032."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531842"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441794"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_35_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems, Vol. 32."},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 25th International Conference on Neural Information Processing Systems -","volume":"1","author":"Soufiani Hossein Azari","year":"2012","unstructured":"Hossein Azari Soufiani, David C. Parkes, and Lirong Xia. 2012. Random Utility Theory for Social Choice. In Proceedings of the 25th International Conference on Neural Information Processing Systems - Volume 1. 126--134."},{"key":"e_1_3_2_1_37_1","unstructured":"Julia Stoyanovich Ke Yang and HV Jagadish. 2018. Online set selection with fairness and diversity constraints (Advances in Database Technology - EDBT). 241--252."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3547333"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532007"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080775"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462953"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3624918.3625313"},{"key":"e_1_3_2_1_46_1","volume-title":"Part I: Score-Based Ranking. ACM Comput. Surv.","volume":"55","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022a. Fairness in Ranking, Part I: Score-Based Ranking. ACM Comput. Surv. , Vol. 55, 6, Article 118 (dec 2022)."},{"key":"e_1_3_2_1_47_1","volume-title":"Part II: Learning-to-Rank and Recommender Systems. ACM Comput. Surv.","volume":"55","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022b. Fairness in Ranking, Part II: Learning-to-Rank and Recommender Systems. ACM Comput. Surv. , Vol. 55, 6, Article 117 (dec 2022)."}],"event":{"name":"SIGIR 2024: The 47th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Washington DC USA","acronym":"SIGIR 2024"},"container-title":["Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657751","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626772.3657751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:31:32Z","timestamp":1755840692000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":47,"alternative-id":["10.1145\/3626772.3657751","10.1145\/3626772"],"URL":"https:\/\/doi.org\/10.1145\/3626772.3657751","relation":{},"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"2024-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}