{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:18:27Z","timestamp":1755998307181,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"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"}],"funder":[{"name":"Elsevier and the Netherlands Organisation for Scientific Research (NWO)","award":["612.001.551"],"award-info":[{"award-number":["612.001.551"]}]},{"name":"Ahold Delhaize, the NWO Innovational Research Incentives Scheme Vidi","award":["016.Vidi.189.039"],"award-info":[{"award-number":["016.Vidi.189.039"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3532045","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:08Z","timestamp":1657206728000},"page":"715-725","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Probabilistic Permutation Graph Search"],"prefix":"10.1145","author":[{"given":"Ali","family":"Vardasbi","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Fatemeh","family":"Sarvi","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh HV Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing Fair Ranking Schemes. In SIGMOD. 1259--1276.  Abolfazl Asudeh HV Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing Fair Ranking Schemes. In SIGMOD. 1259--1276.","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209581"},{"key":"e_1_3_2_1_3_1","volume-title":"Neural Combinatorial Optimization with Reinforcement Learning. arXiv preprint arXiv:1611.09940","author":"Bello Irwan","year":"2016","unstructured":"Irwan Bello , Hieu Pham , Quoc V Le , Mohammad Norouzi , and Samy Bengio . 2016. Neural Combinatorial Optimization with Reinforcement Learning. arXiv preprint arXiv:1611.09940 ( 2016 ). Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. 2016. Neural Combinatorial Optimization with Reinforcement Learning. arXiv preprint arXiv:1611.09940 (2016)."},{"key":"e_1_3_2_1_4_1","volume-title":"Selection and Reinforcement Learning for Combinatorial Optimization. In International Conference on Parallel Problem Solving from Nature. Springer, 601--610","author":"Berny Arnaud","year":"2000","unstructured":"Arnaud Berny . 2000 . Selection and Reinforcement Learning for Combinatorial Optimization. In International Conference on Parallel Problem Solving from Nature. Springer, 601--610 . Arnaud Berny. 2000. Selection and Reinforcement Learning for Combinatorial Optimization. In International Conference on Parallel Problem Solving from Nature. Springer, 601--610."},{"key":"e_1_3_2_1_5_1","volume-title":"Overview of the TREC 2019 Fair Ranking Track. In The Twenty-Eighth Text REtrieval Conference (TREC 2019) Proceedings .","author":"Biega Asia J.","year":"2019","unstructured":"Asia J. Biega , Fernando Diaz , Michael D. Ekstrand , and Sebastian Kohlmeier . 2019 . Overview of the TREC 2019 Fair Ranking Track. In The Twenty-Eighth Text REtrieval Conference (TREC 2019) Proceedings . Asia J. Biega, Fernando Diaz, Michael D. Ekstrand, and Sebastian Kohlmeier. 2019. Overview of the TREC 2019 Fair Ranking Track. In The Twenty-Eighth Text REtrieval Conference (TREC 2019) Proceedings ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Asia J Biega Krishna P Gummadi and Gerhard Weikum. 2018. Equity of Attention: Amortizing Individual Fairness in Rankings. In SIGIR . 405--414.  Asia J Biega Krishna P Gummadi and Gerhard Weikum. 2018. Equity of Attention: Amortizing Individual Fairness in Rankings. In SIGIR . 405--414.","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Garrett Birkhoff. 1940. Lattice Theory .AMS.  Garrett Birkhoff. 1940. Lattice Theory .AMS.","DOI":"10.1090\/coll\/025"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"L Elisa Celis Anay Mehrotra and Nisheeth K Vishnoi. 2020. Interventions for Ranking in the Presence of Implicit Bias. In FAT* . 369--380.  L Elisa Celis Anay Mehrotra and Nisheeth K Vishnoi. 2020. Interventions for Ranking in the Presence of Implicit Bias. In FAT* . 369--380.","DOI":"10.1145\/3351095.3372858"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Ranking with Fairness Constraints","volume":"28","author":"Celis L Elisa","year":"2018","unstructured":"L Elisa Celis , Damian Straszak , and Nisheeth K Vishnoi . 2018 . Ranking with Fairness Constraints . In ICALP. 28 : 1 -- 28 :15. L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2018. Ranking with Fairness Constraints. In ICALP. 28:1--28:15.","journal-title":"ICALP."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371374"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1988.10478679"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6572"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Sahin Cem Geyik Stuart Ambler and Krishnaram Kenthapadi. 2019. Fairness-aware Ranking in Search & Recommendation Systems with Application to Linkedin Talent Search. In SIGKDD. 2221--2231.  Sahin Cem Geyik Stuart Ambler and Krishnaram Kenthapadi. 2019. Fairness-aware Ranking in Search & Recommendation Systems with Application to Linkedin Talent Search. In SIGKDD. 2221--2231.","DOI":"10.1145\/3292500.3330691"},{"volume-title":"AI Powered Search","author":"Grainger Trey","key":"e_1_3_2_1_15_1","unstructured":"Trey Grainger . 2021. AI Powered Search . Manning Publications . Trey Grainger. 2021. AI Powered Search .Manning Publications."},{"volume-title":"Statistical Theory of Extreme Values and Some Practical Applications: A Series of Lectures","author":"Gumbel Emil Julius","key":"e_1_3_2_1_16_1","unstructured":"Emil Julius Gumbel . 1954. Statistical Theory of Extreme Values and Some Practical Applications: A Series of Lectures . Vol. 33 . US Government Printing Office . Emil Julius Gumbel. 1954. Statistical Theory of Extreme Values and Some Practical Applications: A Series of Lectures . Vol. 33. US Government Printing Office."},{"key":"e_1_3_2_1_17_1","volume-title":"Fairness of Exposure in Light of Incomplete Exposure Estimation. In SIGIR 2022: 45th international ACM SIGIR Conference on Research and Development in Information Retrieval. ACM.","author":"Heuss Maria","year":"2022","unstructured":"Maria Heuss , Fatemeh Sarvi , and Maarten de Rijke . 2022 . Fairness of Exposure in Light of Incomplete Exposure Estimation. In SIGIR 2022: 45th international ACM SIGIR Conference on Research and Development in Information Retrieval. ACM. Maria Heuss, Fatemeh Sarvi, and Maarten de Rijke. 2022. Fairness of Exposure in Light of Incomplete Exposure Estimation. In SIGIR 2022: 45th international ACM SIGIR Conference on Research and Development in Information Retrieval. ACM."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of The 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research), , Maria Florina Balcan and Kilian Q. Weinberger (Eds.)","volume":"48","author":"Katariya Sumeet","year":"2016","unstructured":"Sumeet Katariya , Branislav Kveton , Csaba Szepesvari , and Zheng Wen . 2016 . DCM Bandits: Learning to Rank with Multiple Clicks . In Proceedings of The 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research), , Maria Florina Balcan and Kilian Q. Weinberger (Eds.) , Vol. 48 . PMLR, New York, New York, USA, 1215--1224. https:\/\/proceedings.mlr.press\/v48\/katariya16.html Sumeet Katariya, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2016. DCM Bandits: Learning to Rank with Multiple Clicks. In Proceedings of The 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research), , Maria Florina Balcan and Kilian Q. Weinberger (Eds.), Vol. 48. PMLR, New York, New York, USA, 1215--1224. https:\/\/proceedings.mlr.press\/v48\/katariya16.html"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450080"},{"key":"e_1_3_2_1_21_1","volume-title":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Christos H","author":"Kleinberg Jon","year":"2017","unstructured":"Jon Kleinberg , Sendhil Mullainathan , and Manish Raghavan . 2017. Inherent Trade-Offs in the Fair Determination of Risk Scores . In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Christos H . Papadimitriou (Ed.), Vol. 67 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , 43:1--43:23. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS. 2017 .43 10.4230\/LIPIcs.ITCS.2017.43 Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2017. Inherent Trade-Offs in the Fair Determination of Risk Scores. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Christos H. Papadimitriou (Ed.), Vol. 67. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 43:1--43:23. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.43"},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Neural Information Processing Systems","volume":"29","author":"Lagr\u00e9e Paul","year":"2016","unstructured":"Paul Lagr\u00e9e , Claire Vernade , and Olivier Cappe . 2016 . Multiple-Play Bandits in the Position-Based Model . In Advances in Neural Information Processing Systems , Vol. 29 . Curran Associates, Inc. Paul Lagr\u00e9e, Claire Vernade, and Olivier Cappe. 2016. Multiple-Play Bandits in the Position-Based Model. In Advances in Neural Information Processing Systems, Vol. 29. Curran Associates, Inc."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of The 35th Uncertainty in Artificial Intelligence Conference (Proceedings of Machine Learning Research)","volume":"115","author":"Li Chang","year":"2020","unstructured":"Chang Li , Branislav Kveton , Tor Lattimore , Ilya Markov , Maarten de Rijke , Csaba Szepesv\u00e1 ri, and Masrour Zoghi . 2020 . BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback . In Proceedings of The 35th Uncertainty in Artificial Intelligence Conference (Proceedings of Machine Learning Research) , Vol. 115 . PMLR, 196--206. Chang Li, Branislav Kveton, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesv\u00e1 ri, and Masrour Zoghi. 2020. BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback. In Proceedings of The 35th Uncertainty in Artificial Intelligence Conference (Proceedings of Machine Learning Research), Vol. 115. PMLR, 196--206."},{"volume-title":"Individual Choice Behavior","author":"Luce R Duncan","key":"e_1_3_2_1_24_1","unstructured":"R Duncan Luce . 1959. Individual Choice Behavior . John Wiley . R Duncan Luce. 1959. Individual Choice Behavior .John Wiley."},{"key":"e_1_3_2_1_25_1","volume-title":"Weinberger (Eds.)","volume":"27","author":"Maddison Chris J","year":"2014","unstructured":"Chris J Maddison , Daniel Tarlow , and Tom Minka . 2014 . A* Sampling. In Advances in Neural Information Processing Systems , , Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K. Q . Weinberger (Eds.) , Vol. 27 . Curran Associates, Inc. Chris J Maddison, Daniel Tarlow, and Tom Minka. 2014. A* Sampling. In Advances in Neural Information Processing Systems , , Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K. Q. Weinberger (Eds.), Vol. 27. Curran Associates, Inc."},{"key":"e_1_3_2_1_26_1","volume-title":"Beyond Algorithms: Ranking at Scale at Booking.com. In ComplexRec-ImpactRS@RecSys .","author":"Mavridis Themistoklis","year":"2020","unstructured":"Themistoklis Mavridis , Soraya Hausl , Andr\u00e9 Mende , and Roberto Pagano . 2020 . Beyond Algorithms: Ranking at Scale at Booking.com. In ComplexRec-ImpactRS@RecSys . Themistoklis Mavridis, Soraya Hausl, Andr\u00e9 Mende, and Roberto Pagano. 2020. Beyond Algorithms: Ranking at Scale at Booking.com. In ComplexRec-ImpactRS@RecSys ."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00319-7"},{"key":"e_1_3_2_1_28_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 . 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 . 2243--2251.","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Marco Morik Ashudeep Singh Jessica Hong and Thorsten Joachims. 2020. Controlling Fairness and Bias in Dynamic Learning-to-rank. In SIGIR . 429--438.  Marco Morik Ashudeep Singh Jessica Hong and Thorsten Joachims. 2020. Controlling Fairness and Bias in Dynamic Learning-to-rank. In SIGIR . 429--438.","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"volume-title":"Proceedings of the Web Conference 2021 . 158--170","author":"Oosterhuis Harrie","key":"e_1_3_2_1_31_1","unstructured":"Harrie Oosterhuis and Maarten de de Rijke. 2021. Robust Generalization and Safe Query-Specializationin Counterfactual Learning to Rank . In Proceedings of the Web Conference 2021 . 158--170 . Harrie Oosterhuis and Maarten de de Rijke. 2021. Robust Generalization and Safe Query-Specializationin Counterfactual Learning to Rank. In Proceedings of the Web Conference 2021 . 158--170."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_1_33_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_34_1","volume-title":"Comparing Fair Ranking Metrics. arXiv preprint arXiv:2009.01311","author":"Raj Amifa","year":"2020","unstructured":"Amifa Raj , Connor Wood , Ananda Montoly , and Michael D Ekstrand . 2020. Comparing Fair Ranking Metrics. arXiv preprint arXiv:2009.01311 ( 2020 ). Amifa Raj, Connor Wood, Ananda Montoly, and Michael D Ekstrand. 2020. Comparing Fair Ranking Metrics. arXiv preprint arXiv:2009.01311 (2020)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Piotr Sapiezynski Wesley Zeng Ronald E Robertson Alan Mislove and Christo Wilson. 2019. Quantifying the Impact of User Attentionon Fair Group Representation in Ranked Lists. In WWW . 553--562.  Piotr Sapiezynski Wesley Zeng Ronald E Robertson Alan Mislove and Christo Wilson. 2019. Quantifying the Impact of User Attentionon Fair Group Representation in Ranked Lists. In WWW . 553--562.","DOI":"10.1145\/3308560.3317595"},{"key":"e_1_3_2_1_36_1","volume-title":"Understanding and Mitigating the Effect of Outliers in Fair Ranking. arXiv preprint arXiv:2112.11251","author":"Sarvi Fatemeh","year":"2021","unstructured":"Fatemeh Sarvi , Maria Heuss , Mohammad Aliannejadi , Sebastian Schelter , and Maarten de Rijke . 2021. Understanding and Mitigating the Effect of Outliers in Fair Ranking. arXiv preprint arXiv:2112.11251 ( 2021 ). Fatemeh Sarvi, Maria Heuss, Mohammad Aliannejadi, Sebastian Schelter, and Maarten de Rijke. 2021. Understanding and Mitigating the Effect of Outliers in Fair Ranking. arXiv preprint arXiv:2112.11251 (2021)."},{"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","volume-title":"Policy Learning for Fairness in Ranking. arXiv preprint arXiv:1902.04056","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims . 2019. Policy Learning for Fairness in Ranking. arXiv preprint arXiv:1902.04056 ( 2019 ). Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. arXiv preprint arXiv:1902.04056 (2019)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2926725"},{"key":"e_1_3_2_1_40_1","unstructured":"Julia Stoyanovich Ke Yang and HV Jagadish. 2018. Online Set Selection with Fairness and Diversity Constraints. In EDBT. 241--252.  Julia Stoyanovich Ke Yang and HV Jagadish. 2018. Online Set Selection with Fairness and Diversity Constraints. In EDBT. 241--252."},{"key":"e_1_3_2_1_41_1","unstructured":"Andrew Trotman Jon Degenhardt and Surya Kallumadi. 2017. The architecture of ebay search. In eCOM@ SIGIR .  Andrew Trotman Jon Degenhardt and Surya Kallumadi. 2017. The architecture of ebay search. In eCOM@ SIGIR ."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482275"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412031"},{"key":"e_1_3_2_1_44_1","volume-title":"Fairness Definitions Explained. In 2018 IEEE\/ACM International Workshop on Software Fairness (FairWare). 1--7. https:\/\/doi.org\/10","author":"Verma Sahil","year":"2018","unstructured":"Sahil Verma and Julia Rubin . 2018 . Fairness Definitions Explained. In 2018 IEEE\/ACM International Workshop on Software Fairness (FairWare). 1--7. https:\/\/doi.org\/10 .23919\/FAIRWARE.2018.8452913 10.23919\/FAIRWARE.2018.8452913 Sahil Verma and Julia Rubin. 2018. Fairness Definitions Explained. In 2018 IEEE\/ACM International Workshop on Software Fairness (FairWare). 1--7. https:\/\/doi.org\/10.23919\/FAIRWARE.2018.8452913"},{"key":"e_1_3_2_1_45_1","volume-title":"Simple Statistical Gradient-following Algorithms for Connectionist Reinforcement Learning. Machine learning","author":"Williams Ronald J","year":"1992","unstructured":"Ronald J Williams . 1992. Simple Statistical Gradient-following Algorithms for Connectionist Reinforcement Learning. Machine learning , Vol. 8 , 3 ( 1992 ), 229--256. Ronald J Williams. 1992. Simple Statistical Gradient-following Algorithms for Connectionist Reinforcement Learning. Machine learning , Vol. 8, 3 (1992), 229--256."},{"key":"e_1_3_2_1_46_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_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462953"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Ke Yang and Julia Stoyanovich. 2017. Measuring Fairness in Ranked Outputs. In SSDBM. 1--6.  Ke Yang and Julia Stoyanovich. 2017. Measuring Fairness in Ranked Outputs. In SSDBM. 1--6.","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_1_49_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. 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. 1569--1578.","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_50_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)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911500"}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Madrid Spain","acronym":"SIGIR '22"},"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.3532045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3532045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:35Z","timestamp":1750183835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532045"}},"subtitle":["Black-Box Optimization for Fairness in Ranking"],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":51,"alternative-id":["10.1145\/3477495.3532045","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3532045","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"}}]}}