Comparative Study of Gender-Aware Contextual Bandits Performance and Fairness Across Different Gender Groups

Authors

  • Tianqi Li

DOI:

https://doi.org/10.54097/zwawpq05

Keywords:

Contextual Bandit, Gender-fair Bandits, Fairness-utility Trade-offs.

Abstract

The study evaluates the performance and fairness of contextual bandit algorithms in gender-aware recommendation systems, utilizing the MovieLens 1M dataset with simulated biased feedback (β = 0.2 for female users). Standard algorithms like Linear Upper Confidence Bound (LinUCB) and Linear Thompson Sampling (LinTS) are compared with fairness-aware variants (Fair-LinUCB, α-Fair, F-UCB) to assess their ability to balance utility, measured by cumulative regret, and fairness, evaluated through reward gaps and exposure inequality across gender groups. The analysis also examines trade-offs between utility and fairness metrics and establishes a reproducible benchmark for gender-fair bandits. Contributions include a standardized evaluation framework, empirical insights into fairness-utility trade-offs through regret curves and Gini coefficients, and practical guidelines for deploying equitable recommendation systems. Results show that fairness-aware algorithms reduce reward gaps by 40–60% compared to baselines, with regret increases ranging from 50% for Fair-LinUCB (regret: 211.77) to over 600% for F-UCB (regret: 997.82). Fair-LinUCB and α-Fair demonstrate optimal trade-offs, balancing equity and efficiency. The study provides a foundation for equitable sequential decision-making, with future directions including intersectional fairness, online validation, and scalable causal methods.

Downloads

Download data is not yet available.

References

[1] Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 661–670 (2010).

[2] Melchiorre, A.B., Rekabsaz, N., Parada-Cabaleiro, E., Brandl, S., Lesota, O., Schedl, M.: Investigating gender fairness of recommendation algorithms in the music domain. Information Processing & Management 58(5), 102666 (2021).

[3] Huang, W., Labille, K., Wu, X., Lee, D., Heffernan, N.: Achieving user-side fairness in contextual bandits. Human-Centric Intelligent Systems 2(3), 81–94 (2022).

[4] Grazzi, R., et al.: Group meritocratic fairness in linear contextual bandits. In: Advances in Neural Information Processing Systems, NeurIPS (2022).

[5] Huang, W., Zhang, L., Wu, X.: Achieving counterfactual fairness for causal bandit. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, pp. 6952–6959 (2022).

[6] Joseph, M., Kearns, M., Morgenstern, J.H., Roth, A.: Fairness in learning: Classic and contextual bandits. In: Advances in Neural Information Processing Systems, vol. 29 (2016).

[7] Metevier, B., Giguere, S., Brockman, S., Kobren, A., Brun, Y., Brunskill, E., Thomas, P.S.: Offline contextual bandits with high probability fairness guarantees. In: Advances in Neural Information Processing Systems, vol. 32 (2019).

[8] Schumann, C., Lang, Z., Mattei, N., Dickerson, J.P.: Group fairness in bandits with biased feedback. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS (2022).

[9] Chaudhary, S., Sinha, A.: $alpha$-Fair Contextual Bandits. arXiv preprint arXiv:2310.14164 (2023).

[10] Huang, W., Labille, K., Wu, X., Lee, D., Heffernan, N.: Fairness-aware bandit-based recommendation. In: 2021 IEEE International Conference on Big Data, pp. 1273–1278. IEEE (2021).

[11] Guo, H., Naeff, R., Nikulkov, A., Zhu, Z.: Evaluating online bandit exploration in large-scale recommender system. arXiv preprint arXiv:2304.02572 (2023).

Downloads

Published

13-03-2026

Issue

Section

Articles

How to Cite

Li, T. (2026). Comparative Study of Gender-Aware Contextual Bandits Performance and Fairness Across Different Gender Groups. Academic Journal of Science and Technology, 19(3), 403-409. https://doi.org/10.54097/zwawpq05