no code implementations • 29 Jan 2022 • Gourab K Patro, Lorenzo Porcaro, Laura Mitchell, Qiuyue Zhang, Meike Zehlike, Nikhil Garg
Ranking, recommendation, and retrieval systems are widely used in online platforms and other societal systems, including e-commerce, media-streaming, admissions, gig platforms, and hiring.
no code implementations • 25 Mar 2021 • Meike Zehlike, Ke Yang, Julia Stoyanovich
In this survey, we describe four classification frameworks for fairness-enhancing interventions, along which we relate the technical methods surveyed in this paper, discuss evaluation datasets, and present technical work on fairness in score-based ranking.
no code implementations • 23 Dec 2020 • Meike Zehlike, Tom Sühr, Carlos Castillo
In this report we provide an improvement of the significance adjustment from the FA*IR algorithm of Zehlike et al., which did not work for very short rankings in combination with a low minimum proportion $p$ for the protected group.
no code implementations • 27 May 2019 • Meike Zehlike, Tom Sühr, Carlos Castillo, Ivan Kitanovski
We implement two algorithms from the fair ranking literature, namely FA*IR (Zehlike et al., 2017) and DELTR (Zehlike and Castillo, 2018) and provide them as stand-alone libraries in Python and Java.
8 code implementations • 22 May 2018 • Meike Zehlike, Carlos Castillo
Ranked search results have become the main mechanism by which we find content, products, places, and people online.
Information Retrieval Computers and Society H.3.3
no code implementations • 21 Dec 2017 • Meike Zehlike, Philipp Hacker, Emil Wiedemann
As a consequence, the algorithm enables the decision maker to adopt intermediate ``worldviews'' on the degree of discrimination encoded in algorithmic processes, adding nuance to the extreme cases of ``we're all equal'' (WAE) and ``what you see is what you get'' (WYSIWYG) proposed so far in the literature.
2 code implementations • 20 Jun 2017 • Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, Ricardo Baeza-Yates
In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility (i. e., select the "best" candidates) subject to group fairness criteria.