Equity of Attention: Amortizing Individual Fairness in Rankings
Abstract
Rankings of people and items are at the heart of selection-making, match-making, and recommender systems, ranging from employment sites to sharing economy platforms. As ranking positions influence the amount of attention the ranked subjects receive, biases in rankings can lead to unfair distribution of opportunities and resources such as jobs or income. This paper proposes new measures and mechanisms to quantify and mitigate unfairness from a bias inherent to all rankings, namely, the position bias which leads to disproportionately less attention being paid to low-ranked subjects. Our approach differs from recent fair ranking approaches in two important ways. First, existing works measure unfairness at the level of subject groups while our measures capture unfairness at the level of individual subjects, and as such subsume group unfairness. Second, as no single ranking can achieve individual attention fairness, we propose a novel mechanism that achieves amortized fairness, where attention accumulated across a series of rankings is proportional to accumulated relevance. We formulate the challenge of achieving amortized individual fairness subject to constraints on ranking quality as an online optimization problem and show that it can be solved as an integer linear program. Our experimental evaluation reveals that unfair attention distribution in rankings can be substantial, and demonstrates that our method can improve individual fairness while retaining high ranking quality.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The tendency to interact with top-positioned items without considering their relevance creates Position Bias.
“This tendency to interact with top-positioned items without considering their relevance creates Position Bias [7, 78, 84, 85].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [78]
Uncontrolled biases in recommender systems can lead to uneven distribution of opportunities and resources, exacerbating echo chamber or filter bubble effects.
“Usually, a biased system generates the biased output, and the uncontrolled biases can lead to the uneven distribution of opportunities and resources [58, 78], exacerbating the “ 𝐸𝑐ℎ𝑜 𝐶ℎ𝑎𝑚𝑏𝑒𝑟 ” or “ 𝐹𝑖𝑙𝑡𝑒𝑟 𝐵𝑢𝑏𝑏𝑙𝑒𝑠 ” effects [86, 87].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [78]
Users are more likely to interact with items at the top of the recommendation list because these items quickly capture attention.
“Users are more likely to interact with items at the top of the recommendation list because these items quickly capture attention [78].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [78]
Considerations of fairness have been actively studied in the context of rankings and recommender systems.
“Considerations of fairness have been actively studied in the context of rankings and recommender systems.”
From Fairness in machine learning: A survey (2024) · cites this paper as [32]
Cites
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090255 · Cited by 3,501 · see citing works
A Taxonomy of Organizational Justice Theories
Greenberg, J. (1987) · Academy of Management Review · doi:10.5465/amr.1987.4306437 · Cited by 2,309 · see citing works
Certifying and Removing Disparate Impact
Feldman, M., Friedler, S. A., Moeller, J., Scheidegger, C., & Venkatasubramanian, S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783311 · Cited by 1,827 · see citing works
An experimental comparison of click position-bias models
Craswell, N., Zoeter, O. R., Taylor, M. J. H., & Ramsey, B. (2008) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1341531.1341545 · Cited by 947 · see citing works
Fairness-Aware Classifier with Prejudice Remover Regularizer
Kamishima, T., Akaho, S., Asoh, H., & Sakuma, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33486-3_3 · Cited by 694 · see citing works
Discrimination-aware data mining
Pedreshi, D., Ruggieri, S., & Turini, F. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401959 · Cited by 676 · see citing works
Zafar, M. B., Valera, I., Gomez Rodriguez, M., & Gummadi, K. P. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052660 · Cited by 632 · see citing works
Self-citationFairness of Exposure in Rankings
Singh, A., & Joachims, T. (2018) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3219819.3220088 · Cited by 607 · see citing works
Human Decisions and Machine Predictions
Kleinberg, J., Lakkaraju, H., Leskovec, J., Ludwig, J., & Mullainathan, S. (2017) · doi:10.3386/w23180 · Cited by 545 · see citing works
Unbiased Learning-to-Rank with Biased Feedback
Joachims, T., Swaminathan, A., & Schnabel, T. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018699 · Cited by 531 · see citing works
FA*IR: A Fair Top-k Ranking Algorithm
Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., & Baeza-Yates, R. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132938 · Cited by 496 · see citing works
A user browsing model to predict search engine click data from past observations.
Dupret, G., & Piwowarski, B. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390392 · Cited by 443 · see citing works
Chuklin, A., Markov, I., & de Rijke, M. (2015) · Synthesis Lectures on Information Concepts, Retrieval, and Services · doi:10.1007/978-3-031-02294-4 · Cited by 398 · see citing works
Measuring Fairness in Ranked Outputs
Yang, K., & Stoyanovich, J. (2017) · Proceedings of the 29th International Conference on Scientific and Statistical Database Management · doi:10.1145/3085504.3085526 · Cited by 378 · see citing works
Learning to Rank with Selection Bias in Personal Search
Wang, X., Bendersky, M., Metzler, D., & Najork, M. (2016) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2911451.2911537 · Cited by 286 · see citing works
Auditing black-box models for indirect influence
Adler, P., Falk, C., Friedler, S. A., Nix, T., Rybeck, G., Scheidegger, C., Smith, B., & Venkatasubramanian, S. (2018) · Knowledge and Information Systems · doi:10.1007/s10115-017-1116-3 · Cited by 280 · see citing works
Efficient multiple-click models in web search
Guo, F., Liu, C., & Wang, Y. M. (2009) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1498759.1498818 · Cited by 276 · see citing works
Multi-resource fair queueing for packet processing
Ghodsi, A., Sekar, V., Zaharia, M., et al. (2012) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) · doi:10.1145/2342356.2342358 · Cited by 181 · see citing works
Search Engines that Learn from Implicit Feedback
Joachims, T., & Radlinski, F. (2007) · Computer · doi:10.1109/mc.2007.289 · Cited by 176 · see citing works
Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
Armony, M., & Ward, A. R. (2010) · Operations Research · doi:10.1287/opre.1090.0777 · Cited by 122 · see citing works
Auditing Search Engines for Differential Satisfaction Across Demographics
Mehrotra, R., Anderson, A., Díaz, F., Sharma, A. K., Wallach, H., & Yılmaz, E. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3041021.3054197 · Cited by 72 · see citing works
Biega, A. J., Roy, R. S., & Weikum, G. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080830 · Cited by 41 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
A Review on Fairness in Machine Learning
Pessach, D., & Shmueli, E. (2023) · ACM Computing Surveys · doi:10.1145/3494672 · Cited by 598 · see citing works
Fairness in machine learning: A survey
Caton, S., & Haas, C. (2024) · ACM Computing Surveys · doi:10.1145/3616865 · Cited by 646 · see citing works
Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting
De-Arteaga, M., Romanov, A., Wallach, H., Chayes, J., Borgs, C., Chouldechova, A., Geyik, S., Kenthapadi, K., & Kalai, A. T. (2019) · Proceedings of the Conference on Fairness, Accountability, and Transparency · doi:10.1145/3287560.3287572 · Cited by 337 · see citing works
Fairness in Machine Learning: A Survey
Caton, S., & Haas, C. (2020) · arXiv · doi:10.48550/arxiv.2010.04053 · Cited by 646 · see citing works
Quantifying the Impact of User Attentionon Fair Group Representation in Ranked Lists
Sapiezynski, P., Zeng, W., E Robertson, R., Mislove, A., & Wilson, C. (2019) · Companion Proceedings of The 2019 World Wide Web Conference · doi:10.1145/3308560.3317595 · Cited by 92 · see citing works
Large Language Models Empowered Personalized Web Agents
Cai, H., Li, Y., Wang, W., Zhu, F., Shen, X., Li, W., & Chua, T.-S. (2025) · Proceedings of the ACM on Web Conference 2025 · doi:10.1145/3696410.3714842 · Cited by 15 · see citing works
Roy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651
- Authors
- Biega, A. J., Gummadi, K. P., & Weikum, G.
- Affiliations
- Max Planck Institute for Informatics (DE)
- Max Planck Institute for Software Systems (DE)
- Venue
- The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
- Publisher
- ACM
- Published
- 2018-06-27
- Pages
- 405-414
- OpenAlex
- W4300482433
- Cited by
- 337
- References
- 22
- Citations by year
- 2026: 42 · 2025: 42 · 2024: 64 · 2023: 40 · 2022: 52 · 2021: 50 · 2020: 21 · 2019: 22 · 2018: 3 · 2012: 1
- FWCI
- 42.96
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) (publishedVersion)
- Funders
- ERC Synergy Grant (610150)
- Topics
- Social Sciences › Safety Research › Ethics and Social Impacts of AI
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Keywords
- position bias, ranking fairness, individual fairness, recommender systems, online optimization, integer linear programming
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review