FairPath: Fair and Explainable Talent Promotion Prediction Using Counterfactual Explanations and Fairness Constraints

Authors

  • Elisa Sharma Graduate School of Management, University of California, Davis, USA
  • Avery Hall Graduate School of Management, University of California, Davis, USA
  • Hiro Price Graduate School of Management, University of California, Davis, USA
  • Miles Moore Graduate School of Management, University of California, Davis, USA

DOI:

https://doi.org/10.54097/bhp46k56

Keywords:

Algorithmic Fairness, Algorithmic Recourse, Counterfactual Explanations, Explainable AI, Human Resource Analytics, Talent Promotion Prediction

Abstract

Machine-learning models that support promotion decisions are trained on historical HR records and can inherit the unequal treatment those records contain. Recent work such as FairPromote combines adversarial debiasing with SHAP attributions and evaluates outcome-level group fairness, but it does not tell a non-promoted employee what would change the decision, nor whether the effort required to obtain a promotion differs across groups. We present FairPath, which couples fairness constraints with counterfactual explanations. FairPath builds on the FairPromote adversarial encoder–predictor, replaces its loss-maximizing adversary with a confusion objective, and adds a counterfactual logit-pairing constraint that makes promotion scores invariant to flipping the sensitive attribute. For explanation we introduce TCAR, a model-agnostic generator of temporally consistent actionable recourse that searches a lattice of effort improvements and elapsed years exactly, advancing age, tenure and time in role jointly. TCAR also supports a counterfactual audit based on the attribute-flip rate (AFR) and the recourse-burden gap (RBG) between groups. On the IBM HR dataset and a 54,808-employee promotion dataset, under a controlled historical-label-bias protocol with clean test labels, FairPath reduced AFR from 10.2% (MLP) and 14.8% (FairPromote) to 0.1% on IBM-HR and to 0.0% on WNS, and lowered the IBM-HR recourse-burden gap of the MLP from 0.78 to 0.15 cost units without a significant loss of AUC. TCAR returned valid and feasible counterfactuals for every query, whereas none of the counterfactuals produced by DiCE or a gradient-based generator was both valid and feasible.

Downloads

Download data is not yet available.

References

[1] Tambe, M., Cappelli, P., & Yakubovich, V. (2019). Artificial intelligence in human resources management: Challenges and a path forward. California Management Review, 61(4), 15–42. https://doi.org/10.1177/0008125619867910.

[2] Köchling, A., & Wehner, M. C. (2020). Discriminated by an algorithm: A systematic review of discrimination and fairness by algorithmic decision-making in the context of HR recruitment and HR development. Business Research, 13(3), 795–848. https://doi.org/10.1007/s40685-020-00134-w.

[3] Castilla, E. J. (2008). Gender, race, and meritocracy in organizational careers. American Journal of Sociology, 113(6), 1479–1526. https://doi.org/10.1086/588738.

[4] Wang, J., Ge, Y., Liu, J., & Jiang, B. (2024). Early warning of liquidity stress in U.S. banks with seasonally aligned frailty hazards and delayed-feedback conformal alarms. Journal of Trends in Finance and Economics, 1(1), 85–100.

[5] Wang, Z., Yang, J. S., Shang, W., & Ding, J. (2026). FairPromote: Explainable and fairness-aware talent promotion prediction via adversarial debiasing and SHAP-based interpretation. IEEE Access, 14, 72891–72904. https://doi.org/10.1109/ACCESS.2026.3692578.

[6] Wachter, S., Mittelstadt, B., & Russell, C. (2018). Counterfactual explanations without opening the black box: Automated decisions and the GDPR. Harvard Journal of Law & Technology, 31(2), 841–887.

[7] Ustun, B., Spangher, A., & Liu, Y. (2019). Actionable recourse in linear classification. In Proceedings of the Conference on Fairness, Accountability, and Transparency (pp. 10–19). https://doi.org/10.1145/3287560.3287566.

[8] Karimi, A.-H., Barthe, G., Schölkopf, B., & Valera, I. (2022). A survey of algorithmic recourse: Contrastive explanations and consequential recommendations. ACM Computing Surveys, 55(5), Article 95. https://doi.org/10.1145/3527848.

[9] Kusner, M. J., Loftus, J., Russell, C., & Silva, R. (2017). Counterfactual fairness. Advances in Neural Information Processing Systems, 30, 4066–4076.

[10] Gupta, V., Nokhiz, P., Roy, C. D., & Venkatasubramanian, S. (2019). Equalizing recourse across groups. arXiv:1909.03166.

[11] von Kügelgen, J., Karimi, A.-H., Bhatt, U., Valera, I., Weller, A., & Schölkopf, B. (2022). On the fairness of causal algorithmic recourse. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9), 9584–9594. https://doi.org/10.1609/aaai.v36i9.21192.

[12] 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), Article 115. https://doi.org/10.1145/3457607.

[13] 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.

[14] Hardt, M., Price, E., & Srebro, N. (2016). Equality of opportunity in supervised learning. Advances in Neural Information Processing Systems, 29, 3315–3323.

[15] Agarwal, A., Beygelzimer, A., Dudík, M., Langford, J., & Wallach, H. (2018). A reductions approach to fair classification. In Proceedings of the 35th International Conference on Machine Learning (pp. 60–69).

[16] Zhang, B. H., Lemoine, B., & Mitchell, M. (2018). Mitigating unwanted biases with adversarial learning. In Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society (pp. 335–340). https://doi.org/10.1145/3278721.3278779.

[17] Garg, S., Perot, V., Limtiaco, N., Taly, A., Chi, E. H., & Beutel, A. (2019). Counterfactual fairness in text classification through robustness. In Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society (pp. 219–226). https://doi.org/10.1145/3306618.3317950.

[18] Mothilal, R. K., Sharma, A., & Tan, C. (2020). Explaining machine learning classifiers through diverse counterfactual explanations. In Proceedings of the Conference on Fairness, Accountability, and Transparency (pp. 607–617). https://doi.org/10.1145/3351095.3372850.

[19] Chen, J., Han, X., Zhang, X., & Yang, Y. (2023). Exact concept-level explanations for early detection of financial misstatements. Eurasia Journal of Science and Technology, 5(2), 34–48.

[20] Mahajan, D., Tan, C., & Sharma, A. (2019). Preserving causal constraints in counterfactual explanations for machine learning classifiers. arXiv:1912.03277.

[21] Karimi, A.-H., Schölkopf, B., & Valera, I. (2021). Algorithmic recourse: From counterfactual explanations to interventions. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency (pp. 353–362). https://doi.org/10.1145/3442188.3445899.

[22] Ross, A., Lakkaraju, H., & Bastani, O. (2021). Learning models for actionable recourse. Advances in Neural Information Processing Systems, 34.

[23] Sharma, S., Henderson, J., & Ghosh, J. (2020). CERTIFAI: A common framework to provide explanations and analyse the fairness and robustness of black-box models. In Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society (pp. 166–172). https://doi.org/10.1145/3375627.3375812.

[24] Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774.

[25] Lin, T.-Y., Goyal, P., Girshick, R., He, K., & Dollár, P. (2017). Focal loss for dense object detection. In Proceedings of the IEEE International Conference on Computer Vision (pp. 2980–2988). https://doi.org/10.1109/ICCV.2017.324.

[26] Teng, D. (2025). TRIAD: Deadline- and reliability-aware scheduling for post-earthquake structural assessment workflows. World Journal of Engineering Research, 3(6), 55–66.

[27] IBM. (2026, October 22). IBM HR analytics employee attrition & performance. https://github.com/IBM/employee-attrition-aif360.

[28] Wick, M., Panda, S., & Tristan, J.-B. (2019). Unlocking fairness: A trade-off revisited. Advances in Neural Information Processing Systems, 32.

[29] Chen, T., & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 785–794). https://doi.org/10.1145/2939672.2939785.

[30] Weerts, H., Dudík, M., Edgar, R., Jalali, A., Lutz, R., & Madaio, M. (2023). Fairlearn: Assessing and improving fairness of AI systems. Journal of Machine Learning Research, 24(257), 1–8.

[31] Sun, T. (2024). Enhancing auto insurance risk evaluation with Transformer and SHAP. IEEE Access. https://doi.org/10.1109/ACCESS.2024.3446179.

[32] Wang, G., Li, P., Feng, E., Shen, A., & Rhee, M. (2026). A dual-process memory-augmented large language model agent for explainable sequential recommendation. IEEE Access. https://doi.org/10.1109/ACCESS.2026.3741894.

Downloads

Published

29-10-2026

Issue

Section

Articles

How to Cite

Sharma, E., Hall, A., Price, H., & Moore, M. (2026). FairPath: Fair and Explainable Talent Promotion Prediction Using Counterfactual Explanations and Fairness Constraints. International Core Journal of Social Sciences, 2(2), 19-26. https://doi.org/10.54097/bhp46k56