<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Advertisements Responsible for Gender Bias in Candidate Ranking Systems via Counterfactual Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Deepak Kumar</string-name>
          <email>deepak.kumar@jku.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tessa Grosz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elisabeth Greif</string-name>
          <email>elisabeth.greif@jku.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Navid Rekabsaz</string-name>
          <email>navid.rekabsaz@jku.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Markus Schedl</string-name>
          <email>markus.schedl@jku.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>In contrast to these expert annotations</institution>
          ,
          <addr-line>in this paper</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Johannes Kepler University Linz, Institute for Legal Gender Studies</institution>
          ,
          <addr-line>Linz</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Johannes Kepler University Linz, Institute of Computational Perception, Multimedia Mining and Search Group</institution>
          ,
          <addr-line>Linz</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Linz Institute of Technology, AI Lab, Human-centered AI Group</institution>
          ,
          <addr-line>Linz</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>tisements from the CRS's perspective instead of that of a</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Candidate ranking systems (CRSs) for vacancies can pose a significant risk in terms of ethical considerations if they are prone to gender bias or even have legal implications if discriminatory behavior is found. In the case of content-based CRSs, which identify suited candidates for a given job opening based on their resumes and the job advert, gender bias in these texts can also lead to discriminatory behavior of the CRS algorithm. We propose an algorithm to automatically identify gendered words in the job advertisement responsible for gender bias in the rankings. The algorithm determines the words with gendered connotations in the rank distribution for a given job advertisement using content-based job-candidate matching based on the actual biography of a candidate and a counterfactual version in which explicit gender-mentioning terms are swapped between male and female. To this end, we employ the neural network explainability method of integrated gradients to compute CRS's association of the job advertisement words with the gender of candidates, which we call the bias score of words. At the core of our CRS is a cross-encoder architecture. To showcase and validate our approach, we conduct a study investigating the gendered words identified by the proposed algorithm in job advertisements from a private dataset and biographies from the BIOS dataset. We analyze the gendered words along multiple job categories and diferent linguistic categories. Finally, we statistically and qualitatively compare them with standardized lists manually created by social psychologists to contrast the gender associations CRSs make with human associations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction and Background</title>
      <p>
        Candidate selection for jobs has become a very dificult
task for human recruiters to complete due to the vast
amount of applicants for a job advertisement. This has
led to the usage of candidate ranking systems (CRSs). As
man recruiters [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], the introduction of CRS was believed
to be a worthwhile antidote [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. By now, however, bias in
A real-world application concerns a CRS developed by
Amazon, which was promptly discarded when its hiring
decisions evidenced gender discrimination [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Further
empirical evidence of bias in CRSs can be found all over
the industry [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>CRSs commonly leverage content like resumes and
nEvelop-O
(M. Schedl)
Human Resources, in conjunction with the 17th ACM Conference on
advertisements that cause CRSs to rank candidates
differently only because of their gender. Our contribution
is two-fold:
2.</p>
    </sec>
    <sec id="sec-2">
      <title>Method</title>
      <p>
        and compare them with a list of words from pre- candidate pair as input and outputs the relevance score
This work can help us understand the distinction be- bag-of-words based BM25 model [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and then re-rank
tween the human and CRS’s view of a bias-free job ad- these 1000 using our CRS.
      </p>
      <p>• We present an algorithm to identify the words
in job advertisements causing gender bias in the
candidate ranking.
• We analyze the words identified by our algorithm,</p>
      <p>vious studies curated by social psychologists.
vertisement. Both perspectives are essential as the CRS’s
perspective will help us reduce algorithmic gender
discrimination while the human perspective will help us
create a job advertisement desirable to both male and
female job seekers. Furthermore, the comparison between
the two views may help us better understand the
distinction or similarity in the potentially discriminatory nature
of a job advertisement for CRSs and humans. As we will
see, seemingly gender-neutral job advertisements can
inadvertently lead to discriminatory practices by CRSs.</p>
      <p>Additionally, the use of biased language in job ads may
not necessarily result in discriminatory behavior by CRSs.</p>
      <p>It is essential to remain mindful of these potential issues
in order to cultivate a more inclusive and equitable hiring
process.</p>
      <p>The structure of the remaining paper is as follows:
In Section 2, we introduce the CRS used in this work
and explain our algorithm to identify words in job
advertisements causing gender bias in the rankings of the
CRS. Subsequently, in Section 3, we describe the dataset
used in the experiments. Section 4 describes the setup
of the experiments, and their results are presented and
discussed in Section 5. Finally, Section 6 summarizes our
work and gives directions for future research endeavors.</p>
      <sec id="sec-2-1">
        <title>2.1. Candidate Ranking System</title>
        <p>
          We use an LLM-based cross-encoder [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] as our CRS
model to rank the candidates for given job ads. The
architecture is shown in Figure 1. Our CRS takes a
jobused for ranking the candidates (   ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ])
During inference, we rank the top 1000 candidates with
.
        </p>
        <sec id="sec-2-1-1">
          <title>Algorithm 1 Red-word identification</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Require: Gender is binary  ∈ {1, 0}</title>
          <p>()
Given: Job ad  , and recommended candidate list 
Given: Trained ranking model  .  (&lt; ,  &gt;)
is
used for ranking  ,  ∈ 
Given:  to create gender counterfactual candidate.</p>
          <p>is candidate  with opposite gender</p>
        </sec>
        <sec id="sec-2-1-3">
          <title>Given: Bias threshold  .</title>
          <p>Job Ad   :   = { 1, ...,   } , consist  many tokens</p>
        </sec>
        <sec id="sec-2-1-4">
          <title>Integrated gradient</title>
          <p>:  (
Bias score  :  = { 1, ...,   }
Temporary bias score  :  = { 1, ...,   }
 , &lt; ,  &gt;,  )
  ← | (
 , &lt; ,  &gt;,  ) −  (
 , &lt; ,  () &gt;,  )|
  ← 0∀  ∈ 
   = {}
for each  ∈</p>
          <p>do
  ← 0∀  ∈ 
for each   ∈  do
end for
 ←   ( )
for each   ∈  do
if   &lt; 1 then</p>
          <p>← 0
end if
end for
 ←  ⊕  ∗
1
log(()∈+1)
end for
for each   ∈  do
if   &gt;  then</p>
          <p>. (
end if
end for
return   

)</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Job Ad Words for CRS Gender Bias</title>
        <p>We approach the first contribution by identifying the
words in a job advertisement responsible for gender bias
in the ranking of candidates. For this purpose, we create
for each candidate, an artificial gender-counterfactual
candidate. We do this by replacing gendered words,
pronouns, and names in the candidate’s textual materials Job title distribution in train, test, and validation set.
Job Titles
#Train</p>
        <p>
          #Validation
the integrated gradient explainability method [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. 2
        </p>
        <p>Integrated gradient of a word   in job ad  with
candidate  and ranking model  is
where  is the number integral approximation steps and
&lt; ,  &gt;</p>
        <p>is the original input to the model  , &lt;  ′,  ′ &gt;
is the same size masked input (i.e., for the model it is
a blank job advertisement and candidate content of the
same length as original input)</p>
        <p>Algorithm 1 is used to identify words in job ad  
that contribute to the diference in the relevance score
of a candidate  and its gender counterfactual  ()</p>
        <p>by a
trained CRS model  . Integrated gradient</p>
        <p>is used to
identify the contribution  of words towards the
diference, and we further use</p>
        <p>to normalize  . We
scale the normalized  based on the rank of candidate
 in the ranking by  . Finally, we use a bias threshold
 to cut of the less critical red-words. Counterfactual
didate’s nouns and pronouns with that of the opposite
gender. For simplicity, in this work, we restricted the
transformation  to a binary behavior.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset</title>
      <p>
        We created the dataset for the experiment using
biographies from BIOS dataset [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and job advertisements from
a private dataset from UK job portals. Firstly, to create
the dataset, we employ an exact matching algorithm
between the current job mentioned in the biography and
1We consider binary gender here. In the non-binary case, any gender
other than the original can be considered the opposite gender.
2For non-gradient-based CRS explainability, SHAP [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] method can
be used.
53
40
28
0
0
15
0
10
7
3
2
2
2
0
candidate creating transformation  replaces all the can- “bob,” “mr,” “his,” “he,” “him,” and “himself,” while the
 −   ′)
∗

1
(1)
the job for which the job advertisement is advertised to
get the binary matching/relevancy ground truth labels.
      </p>
      <p>The size of the dataset created by matching is 2775 job
posts and 322,337 biographies covering 24 diferent jobs.</p>
      <p>Of these 24 jobs, 10 have a job advertisement frequency
of less than 5 and are removed. Further, a subset of the
BIOS dataset is created such that the subset is balanced
according to the job and gender of candidates. The size
of the balanced subset of biographies is 1400, where each
profession has 50 male and 50 female biographies.
Thereafter, we split the job advertisement into train, test, and
validation sets with stratification of job titles by 70:20:10
split, respectively. So, finally, we are left with 14 diferent
job titles, 1400 biographies with 50 males and 50 females
of each job title, and 2085 job advertisements with job
distributions shown in Table 1
The biographies have been pre-processed by replacing
real names with ”bob” for males and ”alice” for females.</p>
      <p>Additionally, counterfactual biographies have been
generated by replacing gender-specific words with those of
the opposite gender. The male-coded words used are
female-coded words are “alice,” “mrs,” “hers,” “she,” “her,”
and “herself.”</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiment Setup</title>
      <p>
        Experiments are conducted using a BERT-based cross
encoder, i.e., CRS, over our collection of job
advertisements and biographies of candidates (Section 3). CRS
is trained for four epochs using the sigmoid variant of
binary cross entropy loss3 on our collection. We report
ranking performance in terms of nDCG and bias in terms
of true positive rate parity (TPRP) [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ]. TPRP in
candidate recommendation for binary gender attribute
      </p>
      <sec id="sec-4-1">
        <title>3https://pytorch.org/docs/stable/generated/torch.nn.</title>
        <p>BCEWithLogitsLoss.html, access: July 2023
software, senior, engineer, development, team, engineering, experience, design, code, java
software, engineer, team, development, experience, technology, engineering, data, code, engineers
dental, dentist, practice, associate, nhs, care, patients, clinical, private, patient
legal, para, team, firm, law, litigation, client, property, role, commercial
nurse, nursing, nurses, residents, home, training, registered, clinical, shifts, team
school, pupils, teaching, teachers, children, teacher, students, staf, schools, curriculum
architect, projects, design, architectural, practice, residential, team, working, architects, experience
accountant, accounting, accounts, management, tax, finance, audit, reporting, business, experience
painter, decor, painters, painting, looking, shift, working, refurbishment, email
lead, depend, support, logic, principle, depend, understand, active, child, superior</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results and Discussion</title>
      <p>
        ∈ {,  } and recommendation list    for
a job advertisement   is defined as
On the test set for candidate ranking, the CRS achieves a
score of 0.82 nDCG@10. While the ideal nDCG score is 1,
   (  ) = | ( ∈    | =  , (  , ) = 1) this performance is still considered decent [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. However,
− ( ∈    | = , (  , ) = 1)| the result is significantly biased, as the TPRP score shows.
      </p>
      <p>
        (2) The average of TPRP over all job advertisements is 0.326,
where (  , ) = 1 implies that a candidate  sampled and according to Equation. 2, the ideal value of TPRP is 0.
from the candidate set  is suitable for job advertisement The top red-words according to the bias score of tokens
  . Furthermore,    = 0 implies that equal opportu- ( in Algorithm 1) for each job are shown in Table 2 after
nity [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] fairness condition is achieved. removing punctuation, stopwords, numbers, and words
      </p>
      <p>
        We used Algorithm 1 to create three lists of red words with less than three letters. The majority of words here
with diferent bias thresholds: 0.05, 0.02, and 0.002. It’s are relevant for identifying the job, unlike the terms in the
worth noting that the likelihood of randomly selecting a expert-list examples which are not related to any specific
token from CRS’s input is about 1/512 or 0.002. For com- job but are rather generic. This behavior is expected as
parison, We use the word list by social psychologist [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] CRS’s training objective needs to focus on job-related
as our ”expert-list”. We also identified the parts of speech words and, as a result, will get afected more by bias due
for the words in both the red-word and expert lists using to these terms. Contrary to this, the expert-list focuses
NLTK wordnet [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. on words describing the properties of the candidate, and
hence, humans are more likely to associate them with the
candidate’s gender. The red-words for jobs with less than
Red-word distribution for each job using BERT-based CRS.  is set of all job ads of a particular job title.   
 are words found in job ads by Algorithm 1 and by expert-list words respectively.
(R), digits (D), stopwords (W ), and unknown parts (P ).
15 job advertisements in the test dataset are not reported. show less variability.
      </p>
      <p>We observe later that with the increase in the number
The common words between the expert-list and
redof job advertisements, the curated red-words exhibit less
words are few, which aligns with the observation from
variance.
On average, job advertisements contain about 250-400
other. The number of words given by red-words for
words. Table 4 displays the average number of red-words  = 0.05 and the expert-list are close, although, the
comper job for each profession. With the relaxation of bias
mon words between them are very low. We compare
threshold value  , the number of red-words increases, and
also, the number of common words with the expert-list
their parts of speech distribution in Figure 2 to better
understand their composition. The expert-list does not
increases. Here, with the increase in the number of job
contain any digits, stopwords, and unknown parts,
readvertisements, the red-words for more relaxed  values
moving these from red-words will make its distribution
(a) Senior Software Engineer</p>
      <p>(b) Nurse
similar to the expert-list for jobs with more than 15 job expert-list and might not appear in a more refined
redadvertisements. The prevailing part of speech in both list. But anything conclusive cannot be deduced from
the red-words and the expert-list is observed to be the these common words and require further investigation.
noun, followed by the verb, adjective, adjective satellite, Sample job advertisements are shown in Figure 3. Here,
and adverb. Although the two lists have diferent words red-words are highlighted with red color, and expert-list
(common words are few), the parts of speech distribu- words are highlighted with green color. As can be seen,
tions are very similar after removing digits, stopwords, the two methods highlight diferent types of words based
and unknown parts. The existence of digits, stopwords, on their association with either the job or the candidate.
and unknown parts can only be justified due to their rela- In the example of the “Senior Software Engineer” shown
tionship with more meaningful words and needs further in Figure 3a, the words in red are mainly related to the job
investigation. The small overlap between the expert-list of a software engineer, while the word ”understanding”
and red-words observed in the Table 2 can also be seen in from the expert-list is a description of candidate and is not
the Table 3. Table 3 presents the most frequent adjective associated with the job of a software engineer. Similarly,
red-words for each job title and overall most frequent in the example of “Nurse” (Figure 3b), the red-words
expert-list adjectives. Here, the top 2 expert list adjec- “care” and “rehabilitation” aligns with the job of the nurse.
tives, “responsible” and “competitive”, also appear in the The expert-list in this example describes the employer
red-words of “software engineer”, “dentist”, and “nurse”. and the candidate because the same terms can be used to
Some other words common between both lists are “sup- describe both candidate and the employer. Here, the term
port”, “commit”, “child”, and “principle”. These words “ambitious” can be used for both the employer (ambitious
do not show any specific diference from other words in care house) and the candidate (ambitious nurse). Both
examples (see Figure 3) and Table 4 confirm that
genderbiased wording of a job advertisement is quite distinct
from the words causing bias in CRSs. Hence, to come a bit
closer to our goal of a bias-free recruitment process, we
have to give attention to both red-words and expert-list.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion and Future Work</title>
      <p>We present an algorithm to create a list of words from
job advertisements, which CRS associate with the gender
of candidates. In contrast to a well-established list
generated by social psychologists, this list addresses CRSs’
gender bias instead of the perceived gender bias of experts.
So, a gender bias-free wording of a job advertisement is
diferent for an expert and a CRS leveraging LLMs, and
this distinction should be kept in mind while debiasing
the candidate selection process. Although expert-list and
red-words contain diferent words, their composition is
similar in terms of parts of speech distribution.</p>
      <p>As for future work, we plan to investigate more
thoroughly possible similarities and diferences between the
two lists of words. Further, we want to understand how
both lists afect the debiasing of the candidate selection
process. Also, we plan to improve our algorithm after
understanding the reasons for the existence of digits,
stopwords, and unknown parts of speech in red-words.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This research is funded by the Austrian Science Fund
(FWF): DFH-23 and P33526; and by the State of Upper
Austria and the Federal Ministry of Education, Science,
and Research, through grants LIT-2020-9-SEE-113 and
LIT-2021-YOU-215.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I. P.</given-names>
            <surname>Levin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Rouwenhorst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Trisko</surname>
          </string-name>
          ,
          <article-title>Separating gender biases in screening and selecting candidates for hiring and firing</article-title>
          ,
          <source>Social Behavior and Personality: an international journal 33</source>
          (
          <year>2005</year>
          )
          <fpage>793</fpage>
          -
          <lpage>804</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Houser</surname>
          </string-name>
          ,
          <article-title>Can ai solve the diversity problem in the tech industry: Mitigating noise and bias in employment decision-making,</article-title>
          <string-name>
            <given-names>Stan. Tech. L.</given-names>
            <surname>Rev</surname>
          </string-name>
          .
          <volume>22</volume>
          (
          <year>2019</year>
          )
          <fpage>290</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Patro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Porcaro</surname>
          </string-name>
          , L. Mitchell,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zehlike</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Garg</surname>
          </string-name>
          ,
          <article-title>Fair ranking: a critical review, challenges, and future directions</article-title>
          ,
          <source>in: 2022 ACM Conference on Fairness, Accountability, and Transparency</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>1929</fpage>
          -
          <lpage>1942</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Dastin</surname>
          </string-name>
          ,
          <article-title>Amazon scraps secret ai recruiting tool that showed bias against women, in: Ethics of data and analytics</article-title>
          ,
          <source>Auerbach Publications</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>296</fpage>
          -
          <lpage>299</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sánchez-Monedero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dencik</surname>
          </string-name>
          , L. Edwards,
          <article-title>What does it mean to 'solve' the problem of discrimination in hiring? social, technical and legal perspectives from the uk on automated hiring systems</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency</source>
          , FAT* '
          <volume>20</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>458</fpage>
          -
          <lpage>468</lpage>
          . URL: https://doi.org/10.1145/ 3351095.3372849. doi:
          <volume>10</volume>
          .1145/3351095.3372849.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Freire</surname>
          </string-name>
          , L. N. de Castro, e
          <article-title>-recruitment recommender systems: a systematic review</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>63</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          - 1423.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Rekabsaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kopeinik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schedl</surname>
          </string-name>
          ,
          <article-title>Societal biases in retrieved contents: Measurement framework and adversarial mitigation of bert rankers</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>306</fpage>
          -
          <lpage>316</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Bem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Bem</surname>
          </string-name>
          ,
          <article-title>Does sex-biased job advertising “aid and abet” sex discrimination? 1</article-title>
          ,
          <source>Journal of Applied Social Psychology</source>
          <volume>3</volume>
          (
          <year>1973</year>
          )
          <fpage>6</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gaucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Friesen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kay</surname>
          </string-name>
          ,
          <article-title>Evidence that gendered wording in job advertisements exists and sustains gender inequality</article-title>
          .,
          <source>Journal of personality and social psychology 101</source>
          (
          <year>2011</year>
          )
          <fpage>109</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Cryan,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Metzger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Gender bias in the job market: A longitudinal analysis</article-title>
          ,
          <source>Proceedings of the ACM on Human-Computer Interaction</source>
          <volume>1</volume>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>3982</fpage>
          -
          <lpage>3992</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ma</surname>
          </string-name>
          , S.-
          <string-name>
            <surname>C. Lin</surname>
            ,
            <given-names>J.-H.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Pradeep</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <article-title>Pyserini: A python toolkit for reproducible information retrieval research with sparse and dense representations</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>2356</fpage>
          -
          <lpage>2362</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sundararajan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Taly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <article-title>Axiomatic attribution for deep networks</article-title>
          ,
          <source>in: International conference on machine learning, PMLR</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>3319</fpage>
          -
          <lpage>3328</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Lundberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-I.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>A unified approach to interpreting model predictions</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>M. De-Arteaga</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Romanov</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Wallach</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Chayes</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Borgs</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Chouldechova</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Geyik</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Kenthapadi</surname>
            ,
            <given-names>A. T.</given-names>
          </string-name>
          <string-name>
            <surname>Kalai</surname>
          </string-name>
          ,
          <article-title>Bias in bios: A case study of semantic representation bias in a high-stakes setting</article-title>
          ,
          <source>in: proceedings of the Conference on Fairness, Accountability, and Transparency</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>120</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Carey</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Wu,</surname>
          </string-name>
          <article-title>The causal fairness field guide: Perspectives from social and formal sciences</article-title>
          ,
          <source>Frontiers in Big Data</source>
          <volume>5</volume>
          (
          <year>2022</year>
          )
          <fpage>892837</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Luppes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Oosterhuis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. H.</given-names>
            <surname>Schoenmacker</surname>
          </string-name>
          ,
          <article-title>Closing the gender wage gap: Adversarial fairness in job recommendation</article-title>
          ,
          <source>in: 2nd Workshop on Recommender Systems for Human Resources, RecSys-in-HR</source>
          <year>2022</year>
          ,
          <article-title>CEUR-</article-title>
          <string-name>
            <surname>WS</surname>
          </string-name>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srebro</surname>
          </string-name>
          ,
          <article-title>Equality of opportunity in supervised learning</article-title>
          , in: D.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sugiyama</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Luxburg</surname>
            ,
            <given-names>I. Guyon</given-names>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>29</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2016</year>
          . URL: https: //proceedings.neurips.cc/paper_files/paper/2016/ file/9d2682367c3935defcb1f9e247a97c0d-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>C.</given-names>
            <surname>Fellbaum</surname>
          </string-name>
          ,
          <string-name>
            <surname>WordNet:</surname>
          </string-name>
          <article-title>An electronic lexical database</article-title>
          , MIT press,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>He</surname>
          </string-name>
          , T.-Y. Liu,
          <article-title>A theoretical analysis of ndcg type ranking measures</article-title>
          ,
          <source>in: Conference on learning theory, PMLR</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>25</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>