New Algorithm Brings Controllable Individual Fairness Guarantees to Job Recommendations

A team of computer scientists reports the first algorithm to offer a tunable mathematical guarantee of individual fairness in job recommendation. The algorithm, called ε-iFair, is described in a regular paper published on 25 October 2026 in the International Journal of Data Science and Analytics by Stavros Davidopoulos, Panagiotis Symeonidis, Dimitris Sacharidis and Yannis Manolopoulos. Its central contribution is a concept the authors call ε-individual fairness, in which smaller values of the parameter ε correspond to stronger fairness guarantees. The stakes are considerable: job search and recommendation is a multi-billion-dollar business, and LinkedIn alone counts one billion professionals and twenty million job postings. Yet, according to the authors, there has been no algorithmic guarantee for individual fairness on such platforms.

Individual fairness, as the paper defines it, requires that any pair of individuals with similar non-sensitive attributes should be treated similarly. The authors give a concrete illustration: if a woman and a man have similar qualifications, they should be recommended similar jobs that offer equal salary. The principle extends beyond gender to any non-sensitive attribute profile, such as career level or pay expectations, that two job seekers share. The paper also tackles a second requirement: calibration. A calibrated job recommendation should reflect the various qualifications of a job seeker and his or her previous interactions with other job postings in the past, so that the list of suggested jobs mirrors both what the person is qualified for and what they have actually engaged with. The ε-iFair framework is designed to ensure both individual fairness and calibration at the same time, which the authors state is a first for job recommendation.

Technically, the work builds on and extends existing recommendation machinery. The team extends the DetCons algorithm, a calibrated recommendation method, so that it can consider multiple non-sensitive attributes rather than a single one. To measure how well a recommendation list is calibrated, they define a new metric called m-nDKL, an extension of a divergence-based measure that quantifies calibrated job recommendations across several attributes. For individual fairness itself, the authors employ the well-known Kendall’s tau distance, a classical statistic for comparing two rankings. In this setting, the metric compares the ranking lists of non-sensitive attributes — for example, career level and salary — of the jobs that are recommended to pairs of similar job seekers. If two seekers are similar, the rankings of the attributes of their recommended jobs should be close, and the Kendall’s tau distance captures exactly how close they are.

A distinctive feature of the proposal is controllability. The algorithm is capable of controlling what the authors call the ε-fairness loss, meaning that the strength of the fairness guarantee can be dialed through the parameter ε rather than fixed in advance. Smaller values of ε impose tighter constraints on how differently similar job seekers may be treated, while larger values relax the guarantee. The experimental evaluation reported in the paper shows that the proposed ε-iFair algorithm outperforms other well-known algorithms, including NeuMF and DetCons, in terms of calibrated and fair job recommendations, while retaining the ability to control the ε-fairness loss.

The findings rest on the authors’ own experimental evaluation and on the metrics the team defined for the task, namely m-nDKL for calibration and Kendall’s tau distance for individual fairness, so the reported advantage is specific to those measures. The comparisons with NeuMF and DetCons are reported at the level of the abstract, and the full experimental setup is not detailed in the publicly available preview. Within that scope, the work addresses fairness at the level of individual pairs of similar job seekers, asking whether any given pair receives similarly calibrated job lists, with the strength of that guarantee tuned through a single, controllable parameter.

Subject of Research: Algorithmic individual fairness and calibration in job recommendation systems

Article Title: \(\varepsilon \)-iFair: Individual Fairness in Job Recommendations with Controllable \(\varepsilon \)-Fairness Loss

Article References: Davidopoulos, S., Symeonidis, P., Sacharidis, D., & Manolopoulos, Y. (2026). $$\varepsilon $$-iFair: Individual Fairness in Job Recommendations with Controllable $$\varepsilon $$-Fairness Loss. International Journal of Data Science and Analytics, 22(1), 356. https://doi.org/10.1007/s41060-026-01321-4

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01321-4

Keywords: individual fairness, job recommendation, recommender systems, calibration, Kendall's tau distance, epsilon-fairness, DetCons, NeuMF, algorithmic bias, LinkedIn, machine learning, data science