Network Inequality and Fairness Group

We’re excited to share that Mauritz Cartier van Dissel presented our latest work at ACM FAccT 2025 in Athens! 🎉

In collaboration with S. Martin-Gutierrez, L. Espín-Noboa, A. M. Jaramillo, and F. Karimi, we introduce a novel probabilistic definition of fairness for top-k selection in rankings, grounded in sampling without replacement. We demonstrate that by incorporating quotas, our method ensures the desired proportion of protected candidates among the top-k. As the sample size increases, it converges to demographic parity, effectively preventing discrimination at the bottom of the ranking.

📖 Read the full paper: https://lnkd.in/dJqB4GYg
💻 Explore our Python package: https://lnkd.in/dQMG9Apa

Image by freepik