Bias-Aware Information Retrieval Using Multi-Agent LLM Evaluation and Fairness-Constrained Reranking

Authors

  • Sasha J. Woolley School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA. Author
  • Esila van Straaten Department of Computer Science, University of New Hampshire, Durham, NH, USA. Author
  • Shay A. Earl Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS, USA. Author

Keywords:

information retrieval, fairness, bias mitigation, large language models, multi-agent evaluation, reranking, governance, socio-technical systems

Abstract

Bias-aware information retrieval has become a central concern for search engines, recommendation platforms, enterprise knowledge systems, and public-sector digital services. Conventional retrieval pipelines optimize relevance while treating fairness as a secondary constraint, which allows historical inequalities, representation gaps, and feedback loops to persist across rankings. This paper examines a system-level architecture that combines multi-agent large language model evaluation with fairness-constrained reranking. The proposed perspective treats retrieval as a socio-technical infrastructure rather than a purely algorithmic task. It analyzes how multiple evaluator agents can surface divergent judgments about relevance, harm, representational balance, and contextual sensitivity, and how those judgments can inform a reranking layer that enforces explicit fairness constraints. The discussion emphasizes architectural trade-offs among relevance, diversity, transparency, latency, cost, and maintainability. It also considers governance requirements such as auditability, model documentation, escalation pathways, and policy alignment. Particular attention is given to deployment constraints in resource-limited settings, the risk of fairness gerrymandering, the instability of opaque evaluator ensembles, and the need for continuous monitoring after release. Through cross-domain examples from web search, academic discovery, hiring systems, and public information access, the paper argues that fairness-aware retrieval is most credible when it is embedded in institutional processes rather than appended as a final technical filter. The conclusion outlines a research agenda for robust, contestable, and sustainable bias-aware retrieval systems.

References

1. Baeza-Yates, R. (2018). Bias on the web. Communications of the ACM, 61(6), 54–61. https://doi.org/10.1145/3209581

2. Barocas, S., Hardt, M., & Narayanan, A. (2019). Fairness and machine learning: Limitations and opportunities. fairmlbook.org.

3. Bender, E. M., Gebru, T., McMillan-Major, A., & Shmitchell, S. (2021). On the dangers of stochastic parrots: Can language models be too big? In Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency (pp. 610–623). Association for Computing Machinery. https://doi.org/10.1145/3442188.3445922

4. Bommasani, R., Hudson, D. A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M. S., Bohg, J., Bosselut, A., Brunskill, E., Brynjolfsson, E., Buch, S., Card, D., Castellon, R., Chatterji, N., Chen, A., Creel, K., Davis, J. Q., Demszky, D., ... Liang, P. (2021). On the opportunities and risks of foundation models. arXiv. https://arxiv.org/abs/2108.07258

5. Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023). Bias and debias in recommender system: A survey and future directions. ACM Transactions on Information Systems, 41(3), 1–39. https://doi.org/10.1145/3564284

6. Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012). Fairness through awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (pp. 214–226). Association for Computing Machinery. https://doi.org/10.1145/2090236.2090255

7. Ferrara, E. (2023). Fairness and bias in artificial intelligence: A brief survey of sources, impacts, and mitigation strategies. Sci, 6(1), 3. https://doi.org/10.3390/sci6010003

8. Gao, R., & Shah, C. (2020). Toward creating a fairer ranking in search engine results. Information Processing & Management, 57(1), 102138. https://doi.org/10.1016/j.ipm.2019.102138

9. Jin, Can, et al. "Rankflow: A multi-role collaborative reranking workflow utilizing large language models." Companion Proceedings of the ACM on Web Conference 2025. 2025.

10. Joachims, T., Swaminathan, A., & Schnabel, T. (2017). Unbiased learning-to-rank with biased feedback. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining (pp. 781–789). Association for Computing Machinery. https://doi.org/10.1145/3018661.3018699

11. Kamiran, F., & Calders, T. (2012). Data preprocessing techniques for classification without discrimination. Knowledge and Information Systems, 33(1), 1–33. https://doi.org/10.1007/s10115-011-0463-8

12. Lewis, P., Perez, E., Piktus, A., Petroni, F., Karpukhin, V., Goyal, N., Küttler, H., Lewis, M., Yih, W., Rocktäschel, T., Riedel, S., & Kiela, D. (2020). Retrieval-augmented generation for knowledge-intensive NLP tasks. In Advances in Neural Information Processing Systems 33 (pp. 9459–9474).

13. Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., & Galstyan, A. (2021). A survey on bias and fairness in machine learning. ACM Computing Surveys, 54(6), 1–35. https://doi.org/10.1145/3457607

14. Mitchell, M., Wu, S., Zaldivar, A., Barnes, P., Vasserman, L., Hutchinson, B., Spitzer, E., Raji, I. D., & Gebru, T. (2019). Model cards for model reporting. In Proceedings of the Conference on Fairness, Accountability, and Transparency (pp. 220–229). Association for Computing Machinery. https://doi.org/10.1145/3287560.3287596

15. Nogueira, R., & Cho, K. (2019). Passage re-ranking with BERT. arXiv. https://arxiv.org/abs/1901.04085

16. Olteanu, A., Castillo, C., Diaz, F., & Kıcıman, E. (2019). Social data: Biases, methodological pitfalls, and ethical boundaries. Frontiers in Big Data, 2, 13. https://doi.org/10.3389/fdata.2019.00013

17. O'Neil, C. (2016). Weapons of math destruction: How big data increases inequality and threatens democracy. Crown.

18. Raji, I. D., Smart, A., White, R. N., Mitchell, M., Gebru, T., Hutchinson, B., Smith-Loud, J., Theron, D., & Barnes, P. (2020). Closing the AI accountability gap: Defining an end-to-end framework for internal algorithmic auditing. In Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency (pp. 33–44). Association for Computing Machinery. https://doi.org/10.1145/3351095.3372873

19. Robertson, S., & Zaragoza, H. (2009). The probabilistic relevance framework: BM25 and beyond. Foundations and Trends in Information Retrieval, 3(4), 333–389. https://doi.org/10.1561/1500000019

20. Sun, T., Shah, C., & Zhu, Y. (2022). A survey on fairness in information retrieval. arXiv. https://arxiv.org/abs/2205.14020

21. Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., & Baeza-Yates, R. (2017). FAIR: A fair top-k ranking algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (pp. 1569–1578). Association for Computing Machinery. https://doi.org/10.1145/3132847.3132938

Downloads

Published

2026-08-23