Fetching the paper…
Reading the bibliography…
Fairness of exposure is a commonly used notion of fairness for ranking systems.
Lattice Theory
Garrett Birkhoff. 1940 · 1940
Earlier work this paper cites.
Tres observaciones sobre el algebra lineal
Garrett Birkhoff. 1946 · 1946
Earlier work this paper cites.
On an algorithm of G. Birkhoff concerning doubly stochastic matrices
Diane M Johnson, AL Dulmage, and NS Mendelsohn. 1960 · 1960
Earlier work this paper cites.
An n 5 / 2 n^{5/2} Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft and Richard M. Karp. 1973 · 1973
Earlier work this paper cites.
Chengxiang Zhai and John Lafferty. 2001 · 2001
Earlier work this paper cites.
Language Model Information Retrieval with Document Expansion. In Proceedings of the Human Language Technology Conference of the NAACL, Main Conference . 407–414
Tao Tao, Xuanhui Wang, Qiaozhu Mei, and ChengXiang Zhai. 2006 · 2006
Earlier work this paper cites.
Learning to Rank: From Pairwise Approach to Listwise Approach. In Proceedings of the 24th international conference on Machine learning . 129–136
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007 · 2007
Earlier work this paper cites.
Efficient Online Top-K Retrieval with Arbitrary Similarity Measures. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology . 356–367
Prasad M Deshpande, Deepak P, and Krishna Kummamuru. 2008 · 2008
Earlier work this paper cites.
The Probabilistic Relevance Framework: BM25 and Beyond
Stephen Robertson and Hugo Zaragoza. 2009 · 2009
Earlier work this paper cites.
Beyond Position Bias: Examining Result Attractiveness as a Source of Presentation Bias in Clickthrough Data. In Proceedings of the 19th International Conference on World Wide Web . 1011–1018
Yisong Yue, Rajan Patel, and Hein Roehrig. 2010 · 2010
Earlier work this paper cites.
On Top-k Recommendation Using Social Networks. In Proceedings of the Sixth ACM Conference on Recommender Systems . 67–74
Xiwang Yang, Harald Steck, Yang Guo, and Yong Liu. 2012 · 2012
Earlier work this paper cites.
Top-K Ranking: An Information-theoretic Perspective. In 2015 IEEE Information Theory Workshop - Fall (ITW) . 212–213
Yuxin Chen and Changho Suh. 2015 · 2015
Earlier work this paper cites.
Click Models for Web Search
Aleksandr Chuklin, Ilya Markov, and Maarten de Rijke. 2015 · 2015
Earlier work this paper cites.
Learning to Rank with Selection Bias in Personal Search. In Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval . 115–124
Xuanhui Wang, Michael Bendersky, Donald Metzler, and Marc Najork. 2016 · 2016
Earlier work this paper cites.
Unbiased Learning-to-Rank with Biased Feedback. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining . 781–789
Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017 · 2017
Earlier work this paper cites.
Equality of Opportunity in Rankings. In Workshop on Prioritizing Online Content (WPOC) at NIPS . 31
Ashudeep Singh and Thorsten Joachims. 2017 · 2017
Earlier work this paper cites.
Measuring Fairness in Ranked Outputs. In Proceedings of the 29th International Conference on Scientific and Statistical Database Management . Article 22, 6 pages
Ke Yang and Julia Stoyanovich. 2017 · 2017
Cited alongside, same era.
FA*IR: A Fair Top-k Ranking Algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management . 1569–1578
Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, and Ricardo Baeza-Yates. 2017 · 2017
Cited alongside, same era.
Unbiased Learning to Rank with Unbiased Propensity Estimation. In Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval . 385–394
Qingyao Ai, Keping Bi, Cheng Luo, Jiafeng Guo, and W Bruce Croft. 2018 · 2018
Cited alongside, same era.
Equity of Attention: Amortizing Individual Fairness in Rankings. In Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval . 405–414
Asia J Biega, Krishna P Gummadi, and Gerhard Weikum. 2018 · 2018
Cited alongside, same era.
Evaluating Stochastic Rankings with Expected Exposure. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management . 275–284
Fernando Diaz, Bhaskar Mitra, Michael D Ekstrand, Asia J Biega, and Ben Carterette. 2020 · 2020
Later among the works it cites.
When Inverse Propensity Scoring does not Work: Affine Corrections for Unbiased Learning to Rank. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management . 1475–1484
Ali Vardasbi, Harrie Oosterhuis, and Maarten de Rijke. 2020 · 2020
Later among the works it cites.
Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. In Proceedings of The Web Conference 2020 . 2849–2855
Meike Zehlike and Carlos Castillo. 2020 · 2020
Later among the works it cites.
Fairness and Discrimination in Information Access Systems
Michael D. Ekstrand, Anubrata Das, Robin Burke, and Fernando Diaz. 2021 · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) . 28:1–28:15
L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018 · 2018
Cited alongside, same era.
Further notes on Birkhoff–von Neumann decomposition of doubly stochastic matrices
Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, and Bora Uçar. 2018 · 2018
Cited alongside, same era.
Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction in Recommendation Systems. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management . 2243–2251
Rishabh Mehrotra, James McInerney, Hugues Bouchard, Mounia Lalmas, and Fernando Diaz. 2018 · 2018
Cited alongside, same era.
Fairness of Exposure in Rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 2219–2228
Ashudeep Singh and Thorsten Joachims. 2018 · 2018
Cited alongside, same era.
Position Bias Estimation for Unbiased Learning to Rank in Personal Search. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining . 610–618
Xuanhui Wang, Nadav Golbandi, Michael Bendersky, Donald Metzler, and Marc Najork. 2018 · 2018
Cited alongside, same era.
Estimating Position Bias without Intrusive Intervunentions. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining . 474–482
Aman Agarwal, Ivan Zaitsev, Xuanhui Wang, Cheng Li, Marc Najork, and Thorsten Joachims. 2019 · 2019
Cited alongside, same era.
Fairness and Transparency in Ranking. In ACM SIGIR Forum , Vol. 52. 64–71
Carlos Castillo. 2019 · 2019
Cited alongside, same era.
Intervention Harvesting for Context-Dependent Examination-Bias Estimation. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval . 825–834
Zhichong Fang, Aman Agarwal, and Thorsten Joachims. 2019 · 2019
Cited alongside, same era.
Overview of the TREC 2021 Fair Ranking Track. In The Thirtieth Text REtrieval Conference (TREC 2021) Proceedings
Michael D. Ekstrand, Graham McDonald, Amifa Raj, and Isaac Johnson. 2022 · 2021
Later among the works it cites.
Fairness and Control of Exposure in Two-sided Markets. In Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval
Thorsten Joachims. 2021 · 2021
Later among the works it cites.
Fairness in Ranking under Uncertainty. In Advances in Neural Information Processing Systems , Vol. 34. Curran Associates, Inc., 11896–11908
Ashudeep Singh, David Kempe, and Thorsten Joachims. 2021 · 2021
Later among the works it cites.
Mixture-Based Correction for Position and Trust Bias in Counterfactual Learning to Rank. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management . 1869–1878
Ali Vardasbi, Maarten de Rijke, and Ilya Markov. 2021 · 2021
Later among the works it cites.
User Fairness, Item Fairness, and Diversity for Rankings in Two-Sided Markets. In Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval . 23–41
Lequn Wang and Thorsten Joachims. 2021 · 2021
Later among the works it cites.
Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issue. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval . 1288–1297
Wenjie Wang, Fuli Feng, Xiangnan He, Hanwang Zhang, and Tat-Seng Chua. 2021 · 2021
Later among the works it cites.
Policy-Gradient Training of Fair and Unbiased Ranking Functions. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval . 1044–1053
Himank Yadav, Zhengxiao Du, and Thorsten Joachims. 2021 · 2021
Later among the works it cites.
Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2021 · 2021
Later among the works it cites.
Understanding and Mitigating the Effect of Outliers in Fair Ranking. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining . 861–869
Fatemeh Sarvi, Maria Heuss, Mohammad Aliannejadi, Sebastian Schelter, and Maarten de Rijke. 2022 · 2022
Closest in time.
Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval . ACM
Ali Vardasbi, Fatemeh Sarvi, and Maarten de Rijke. 2022 · 2022
Closest in time.
Fair Top-k Ranking with multiple protected groups
Meike Zehlike, Tom Sühr, Ricardo Baeza-Yates, Francesco Bonchi, Carlos Castillo, and Sara Hajian. 2022 · 2022
Closest in time.