Individual Fairness In Strategic Classification

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zuo, Zhiqun, Khalili, Mohammad Mahdi
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912879103442944
author Zuo, Zhiqun
Khalili, Mohammad Mahdi
author_facet Zuo, Zhiqun
Khalili, Mohammad Mahdi
contents Strategic classification, where individuals modify their features to influence machine learning (ML) decisions, presents critical fairness challenges. While group fairness in this setting has been widely studied, individual fairness remains underexplored. We analyze threshold-based classifiers and prove that deterministic thresholds violate individual fairness. Then, we investigate the possibility of using a randomized classifier to achieve individual fairness. We introduce conditions under which a randomized classifier ensures individual fairness and leverage these conditions to find an optimal and individually fair randomized classifier through a linear programming problem. Additionally, we demonstrate that our approach can be extended to group fairness notions. Experiments on real-world datasets confirm that our method effectively mitigates unfairness and improves the fairness-accuracy trade-off.
format Preprint
id arxiv_https___arxiv_org_abs_2602_05084
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Individual Fairness In Strategic Classification
Zuo, Zhiqun
Khalili, Mohammad Mahdi
Machine Learning
Artificial Intelligence
Strategic classification, where individuals modify their features to influence machine learning (ML) decisions, presents critical fairness challenges. While group fairness in this setting has been widely studied, individual fairness remains underexplored. We analyze threshold-based classifiers and prove that deterministic thresholds violate individual fairness. Then, we investigate the possibility of using a randomized classifier to achieve individual fairness. We introduce conditions under which a randomized classifier ensures individual fairness and leverage these conditions to find an optimal and individually fair randomized classifier through a linear programming problem. Additionally, we demonstrate that our approach can be extended to group fairness notions. Experiments on real-world datasets confirm that our method effectively mitigates unfairness and improves the fairness-accuracy trade-off.
title Individual Fairness In Strategic Classification
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2602.05084