<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:22:02Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/113004" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/113004</identifier><datestamp>2026-05-15T19:42:51Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Bayoumi, Magd</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Joachims, Thorsten</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Cardie, Claire</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-03-31T16:40:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-03-31T16:40:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-12</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11599</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 29996238</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/113004</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/gx14-4a22</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">15644158</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">58 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Implicit bias is the unconscious attribution of particular qualities (or lack of) to a member from a particular social group (e.g. defined by race or gender). Studies on implicit bias have shown that these unconscious stereotypes can have adverse outcomes in various social contexts, such as job screening, teaching, or policing. This dissertation advocates for an application of fairness based re-ranking methods to improve the fairness to all items which, to some surprise, comes with little cost to or can even improve the utility. We present our key contributions in ranking when in the presence of implicit bias. This includes the development of a theorem where we prove that under simplifying assumptions on the utilities of items, simple, well-studied, constraints can ensure that the utility does not decrease with respect to a naive ranking. Finally, we augment our theoretical results with empirical findings on real-world distributions from the IIT-JEE (2009) dataset.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights" lang="*">Attribution-NoDerivatives 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="*">https://creativecommons.org/licenses/by-nd/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Artificial Intelligence</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Bias and Fairness</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Machine Learning</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">RANKING PROBLEMS IN THE PRESENCE OF IMPLICIT BIAS</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/15644158</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Master of Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">M.S., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Bayoumi, Magd</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b0f7a6b3-f7c9-41aa-8e45-41f463ce43f3">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>RANKING PROBLEMS IN THE PRESENCE OF IMPLICIT BIAS&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2022-12&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/gx14-4a22&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Bayoumi, Magd&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by-nd/4.0/&lt;/License>
    &lt;Keyword>Artificial Intelligence&lt;/Keyword>
    &lt;Keyword>Bias and Fairness&lt;/Keyword>
    &lt;Keyword>Machine Learning&lt;/Keyword>
   	&lt;Abstract>Implicit bias is the unconscious attribution of particular qualities (or lack of) to a member from a particular social group (e.g. defined by race or gender). Studies on implicit bias have shown that these unconscious stereotypes can have adverse outcomes in various social contexts, such as job screening, teaching, or policing. This dissertation advocates for an application of fairness based re-ranking methods to improve the fairness to all items which, to some surprise, comes with little cost to or can even improve the utility. We present our key contributions in ranking when in the presence of implicit bias. This includes the development of a theorem where we prove that under simplifying assumptions on the utilities of items, simple, well-studied, constraints can ensure that the utility does not decrease with respect to a naive ranking. Finally, we augment our theoretical results with empirical findings on real-world distributions from the IIT-JEE (2009) dataset.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>