{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:10:08Z","timestamp":1750180208835,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2112665,IIS-204595"],"award-info":[{"award-number":["CCF-2112665,IIS-204595"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,8]]},"DOI":"10.1145\/3600211.3604671","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T18:41:37Z","timestamp":1693334497000},"page":"205-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sampling Individually-Fair Rankings that are Always Group Fair"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0179-9905","authenticated-orcid":false,"given":"Sruthi","family":"Gorantla","sequence":"first","affiliation":[{"name":"Computer Science and Automation, Indian Institute of Science, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8566-5452","authenticated-orcid":false,"given":"Anay","family":"Mehrotra","sequence":"additional","affiliation":[{"name":"Yale University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8638-1120","authenticated-orcid":false,"given":"Amit","family":"Deshpande","sequence":"additional","affiliation":[{"name":"Microsoft, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4727-9219","authenticated-orcid":false,"given":"Anand","family":"Louis","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, India"}]}],"member":"320","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal Sreenivas Gollapudi Alan Halverson and Samuel Ieong. 2009. Diversifying Search Results. In WSDM. ACM 5\u201314.","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361688"},{"key":"e_1_3_2_1_3_1","volume-title":"Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. Operations Research","author":"Asadpour Arash","year":"2022","unstructured":"Arash Asadpour, Rad Niazadeh, Amin Saberi, and Ali Shameli. 2022. Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. Operations Research (2022)."},{"key":"e_1_3_2_1_4_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1770\u20131780","author":"Awasthi Pranjal","year":"2020","unstructured":"Pranjal Awasthi, Matth\u00e4us Kleindessner, and Jamie Morgenstern. 2020. Equalized Odds Postprocessing under Imperfect Group Information. In International Conference on Artificial Intelligence and Statistics. PMLR, 1770\u20131780."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411514"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3237383.3237843"},{"key":"e_1_3_2_1_7_1","unstructured":"Michael Bendersky and Xuanhui Wang. 2021. Advances in TF-Ranking. https:\/\/ai.googleblog.com\/2021\/07\/advances-in-tf-ranking.html."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Asia\u00a0J. Biega Krishna\u00a0P. Gummadi and Gerhard Weikum. 2018. Equity of Attention: Amortizing Individual Fairness in Rankings. In SIGIR. ACM 405\u2013414.","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1982-026-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_11_1","volume-title":"From RankNet to LambdaRank to LambdaMART: An Overview. Learning","author":"Burges J.C.","year":"2010","unstructured":"Christopher\u00a0J.C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Learning (2010)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308774.3308783"},{"key":"e_1_3_2_1_13_1","unstructured":"L.\u00a0Elisa Celis Lingxiao Huang Vijay Keswani and Nisheeth\u00a0K. Vishnoi. 2021. Fair Classification with Noisy Protected Attributes. In ICML(Proceedings of Machine Learning Research Vol.\u00a0120). PMLR."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287601"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3415210"},{"key":"e_1_3_2_1_16_1","unstructured":"L.\u00a0Elisa Celis Anay Mehrotra and Nisheeth\u00a0K. Vishnoi. 2021. Fair Classification with Adversarial Perturbations. In Advances in Neural Information Processing Systems A.\u00a0Beygelzimer Y.\u00a0Dauphin P.\u00a0Liang and J.\u00a0Wortman Vaughan (Eds.). https:\/\/openreview.net\/forum?id=LEqVjnffcWo"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.28"},{"key":"e_1_3_2_1_18_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2019. Matroids Matchings and Fairness. In AISTATS(Proceedings of Machine Learning Research Vol.\u00a089). PMLR 2212\u20132220."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/122860.122861"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775226"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Siddartha Devic David Kempe Vatsal Sharan and Aleksandra Korolova. 2023. Fairness in Matching under Uncertainty. https:\/\/doi.org\/10.48550\/ARXIV.2302.03810","DOI":"10.48550\/ARXIV.2302.03810"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399482"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1419828112"},{"key":"e_1_3_2_1_24_1","unstructured":"Seyed\u00a0A. Esmaeili Brian Brubach Leonidas Tsepenekas and John Dickerson. 2020. Probabilistic Fair Clustering. In NeurIPS."},{"key":"e_1_3_2_1_25_1","volume-title":"Fair algorithms for selecting citizens","author":"Flanigan Bailey","year":"2021","unstructured":"Bailey Flanigan, Paul G\u00f6lz, Anupam Gupta, Brett Hennig, and Ariel\u00a0D. Procaccia. 2021. Fair algorithms for selecting citizens\u2019 assemblies. Nature 596, 7873 (2021), 548\u2013552."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467349"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Sahin\u00a0Cem Geyik Stuart Ambler and Krishnaram Kenthapadi. 2019. Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search. In KDD. ACM 2221\u20132231.","DOI":"10.1145\/3292500.3330691"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462850"},{"key":"e_1_3_2_1_29_1","unstructured":"Sruthi Gorantla Amit Deshpande and Anand Louis. 2021. On the Problem of Underranking in Group-Fair Ranking. In ICML(Proceedings of Machine Learning Research Vol.\u00a0139). PMLR 3777\u20133787."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2998181.2998327"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_33_1","unstructured":"Matthew Kay Cynthia Matuszek and Sean\u00a0A. Munson. 2015. Unequal Representation and Gender Stereotypes in Image Search Results for Occupations. In CHI. ACM 3819\u20133828."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1086\/494491"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2018.33"},{"key":"e_1_3_2_1_36_1","volume-title":"Ordered Submodularity and its Applications to Diversifying Recommendations. arXiv preprint arXiv:2203.00233","author":"Kleinberg Jon","year":"2022","unstructured":"Jon Kleinberg, Emily Ryu, and \u00c9va Tardos. 2022. Ordered Submodularity and its Applications to Diversifying Recommendations. arXiv preprint arXiv:2203.00233 (2022)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498490"},{"key":"e_1_3_2_1_39_1","unstructured":"Alexandre\u00a0Louis Lamy and Ziyuan Zhong. 2019. Noise-Tolerant Fair Classification. In NeurIPS. 294\u2013305."},{"volume-title":"Iterative Methods in Combinatorial Optimization","author":"Lau Lap\u00a0Chi","key":"e_1_3_2_1_40_1","unstructured":"Lap\u00a0Chi Lau, R. Ravi, and Mohit Singh. 2011. Iterative Methods in Combinatorial Optimization. Cambridge University Press. https:\/\/books.google.com\/books?id=TjE7g0Yr0ScC"},{"volume-title":"Encyclopedia of Language and Linguistics","author":"Liddy D.","key":"e_1_3_2_1_41_1","unstructured":"Elizabeth\u00a0D. Liddy. 2005. Automatic Document Retrieval. In Encyclopedia of Language and Linguistics. Elsevier."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_43_1","first-page":"100","article-title":"Introduction to Information Retrieval","volume":"16","author":"Manning Christopher","year":"2010","unstructured":"Christopher Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. 2010. Introduction to Information Retrieval. Natural Language Engineering 16, 1 (2010), 100\u2013103.","journal-title":"Natural Language Engineering"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Anay Mehrotra and L.\u00a0Elisa Celis. 2021. Mitigating Bias in Set Selection with Noisy Protected Attributes. In FAccT. ACM 237\u2013248.","DOI":"10.1145\/3442188.3445887"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533124"},{"key":"e_1_3_2_1_46_1","volume-title":"Fair Ranking with Noisy Protected Attributes. In Thirty-Sixth Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=mTra5BIUyRV","author":"Mehrotra Anay","year":"2022","unstructured":"Anay Mehrotra and Nisheeth\u00a0K. Vishnoi. 2022. Fair Ranking with Noisy Protected Attributes. In Thirty-Sixth Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=mTra5BIUyRV"},{"key":"e_1_3_2_1_47_1","volume-title":"Fairness for Robust Learning to Rank. CoRR abs\/2112.06288","author":"Memarrast Omid","year":"2021","unstructured":"Omid Memarrast, Ashkan Rezaei, Rizal Fathony, and Brian\u00a0D. Ziebart. 2021. Fairness for Robust Learning to Rank. CoRR abs\/2112.06288 (2021). arXiv:2112.06288https:\/\/arxiv.org\/abs\/2112.06288"},{"key":"e_1_3_2_1_48_1","unstructured":"Christopher Mims. 2020. Why Social Media Is So Good at Polarizing Us. https:\/\/www.wsj.com\/articles\/why-social-media-is-so-good-at-polarizing-us-11603105204."},{"key":"e_1_3_2_1_49_1","unstructured":"Hussein Mozannar Mesrob\u00a0I. Ohannessian and Nathan Srebro. 2020. Fair Learning with Private Demographic Data. In ICML(Proceedings of Machine Learning Research Vol.\u00a0119). PMLR 7066\u20137075."},{"volume-title":"Algorithms of Oppression: How Search Engines Reinforce Racism","author":"Noble Safiya\u00a0Umoja","key":"e_1_3_2_1_50_1","unstructured":"Safiya\u00a0Umoja Noble. 2018. Algorithms of Oppression: How Search Engines Reinforce Racism. NYU Press."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_1_52_1","volume-title":"Bipartite Matchings with Group Fairness and Individual Fairness Constraints. CoRR abs\/2208.09951","author":"Panda Atasi","year":"2022","unstructured":"Atasi Panda, Anand Louis, and Prajakta Nimbhorkar. 2022. Bipartite Matchings with Group Fairness and Individual Fairness Constraints. CoRR abs\/2208.09951 (2022)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533238"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00697-y"},{"key":"e_1_3_2_1_55_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency. Number v. 1, 2, and 3 in Algorithms and Combinatorics","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Number v. 1, 2, and 3 in Algorithms and Combinatorics. Springer. https:\/\/books.google.com\/books?id=mqGeSQ6dJycC"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In KDD. ACM 2219\u20132228.","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_57_1","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. In NeurIPS. 5427\u20135437."},{"key":"e_1_3_2_1_58_1","volume-title":"Advances in Neural Information Processing Systems, M.\u00a0Ranzato, A.\u00a0Beygelzimer, Y.\u00a0Dauphin, P.S. Liang, and J.\u00a0Wortman Vaughan (Eds.). Vol.\u00a034. Curran Associates","author":"Singh Ashudeep","year":"1896","unstructured":"Ashudeep Singh, David Kempe, and Thorsten Joachims. 2021. Fairness in Ranking under Uncertainty. In Advances in Neural Information Processing Systems, M.\u00a0Ranzato, A.\u00a0Beygelzimer, Y.\u00a0Dauphin, P.S. Liang, and J.\u00a0Wortman Vaughan (Eds.). Vol.\u00a034. Curran Associates, Inc., 11896\u201311908. https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/63c3ddcc7b23daa1e42dc41f9a44a873-Paper.pdf"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316744"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183698"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445915"},{"key":"e_1_3_2_1_62_1","unstructured":"Serena Wang Wenshuo Guo Harikrishna Narasimhan Andrew Cotter Maya\u00a0R. Gupta and Michael\u00a0I. Jordan. 2020. Robust Optimization for Fairness with Noisy Protected Groups. In NeurIPS."},{"key":"e_1_3_2_1_63_1","volume-title":"Large Scale Image Annotation: Learning to Rank with Joint Word-Image Embeddings. Machine learning 81, 1","author":"Weston Jason","year":"2010","unstructured":"Jason Weston, Samy Bengio, and Nicolas Usunier. 2010. Large Scale Image Annotation: Learning to Rank with Joint Word-Image Embeddings. Machine learning 81, 1 (2010), 21\u201335."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Ke Yang Vasilis Gkatzelis and Julia Stoyanovich. 2019. Balanced Ranking with Diversity Constraints. In IJCAI. ijcai.org 6035\u20136042.","DOI":"10.24963\/ijcai.2019\/836"},{"key":"e_1_3_2_1_65_1","first-page":"1","article-title":"Causal Intersectionality and Fair Ranking. In FORC(LIPIcs, Vol.\u00a0192)","volume":"7","author":"Yang Ke","year":"2021","unstructured":"Ke Yang, Joshua\u00a0R. Loftus, and Julia Stoyanovich. 2021. Causal Intersectionality and Fair Ranking. In FORC(LIPIcs, Vol.\u00a0192). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1\u20137:20.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Meike Zehlike and Carlos Castillo. 2020. Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. In WWW. ACM \/ IW3C2 2849\u20132855.","DOI":"10.1145\/3366424.3380048"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","unstructured":"Meike Zehlike Ke Yang and Julia Stoyanovich. 2022. Fairness in Ranking Part I: Score-Based Ranking. ACM Comput. Surv. (2022). https:\/\/doi.org\/10.1145\/3533379 Just Accepted.","DOI":"10.1145\/3533379"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533380"}],"event":{"name":"AIES '23: AAAI\/ACM Conference on AI, Ethics, and Society","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence"],"location":"Montr\u00e9al QC Canada","acronym":"AIES '23"},"container-title":["Proceedings of the 2023 AAAI\/ACM Conference on AI, Ethics, and Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600211.3604671","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3600211.3604671","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3600211.3604671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:39Z","timestamp":1750178259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600211.3604671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":69,"alternative-id":["10.1145\/3600211.3604671","10.1145\/3600211"],"URL":"https:\/\/doi.org\/10.1145\/3600211.3604671","relation":{},"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"2023-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}