<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.0/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">IR</journal-id>
<journal-title-group>
<journal-title>Information Research</journal-title>
</journal-title-group>
<issn pub-type="epub">1368-1613</issn>
<publisher>
<publisher-name>University of Bor&#x00E5;s</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">ir31262019</article-id>
<article-id pub-id-type="doi">10.47989/ir31262019</article-id>
<article-categories>
<subj-group xml:lang="en">
<subject>Research article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>FAIRS: a framework for rethinking algorithmic fairness in the context of information access</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Udoh</surname><given-names>Emmanuel Sebastian</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Yuan</surname><given-names>Xiaojun</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Rorissa</surname><given-names>Abebe</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<aff id="aff1"><bold>Emmanuel Sebastian Udoh</bold> is a Visiting Assistant Professor in the Massry School of Business, University at Albany, State University of New York, USA. He received his Ph.D. from the University at Albany, and his research interests include algorethics, responsible artificial intelligence, machine learning, the Internet of Things, smart cities, data fairness, algorithmic fairness, and the value-sensitive design of algorithmic decision systems. He can be contacted at <email xlink:href="eudoh@albany.edu.">eudoh@albany.edu.</email></aff>
<aff id="aff2"><bold>Xiaojun (Jenny) Yuan</bold> is an Associate Professor in the College of Emergency Preparedness, Homeland Security and Cybersecurity, University at Albany, State University of New York. She received her Ph.D. from Rutgers University, the State University of New Jersey, New Brunswick, NJ, USA, and her research interests include human information behaviour, user interface design and evaluation, voice-enabled intelligent agent, and socially vulnerable populations. She can be contacted at <email xlink:href="xyuan@albany.edu.">xyuan@albany.edu.</email></aff>
<aff id="aff3"><bold>Abebe Rorissa</bold> is a Professor &#x0026; Rene and Clara Said Director of the School of Information Sciences, University of Tennessee, Knoxville, USA. He received his Ph.D. from the University of North Texas and his research interests include multimedia information organization and retrieval; scaling of users&#x2019; information needs; use, acceptance, adoption, and impact of information and communication technologies, and data analytics. He can be contacted at <email xlink:href="arorissa@utk.edu.">arorissa@utk.edu.</email></aff>
</contrib-group>
<pub-date pub-type="epub"><day>25</day><month>05</month><year>2026</year></pub-date>
<pub-date pub-type="collection"><year>2026</year></pub-date>
<volume>31</volume>
<issue>2</issue>
<fpage>320</fpage>
<lpage>347</lpage>
<permissions>
<copyright-year>2026</copyright-year>
<copyright-holder>&#x00A9; 2026 The Author(s).</copyright-holder>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by-nc/4.0/">
<license-p>This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by-nc/4.0/">http://creativecommons.org/licenses/by-nc/4.0/</ext-link>), permitting all non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<abstract xml:lang="en">
<title>Abstract</title>
<p><bold>Introduction.</bold> Artificial intelligence and machine learning increasingly shape information access, enhancing efficiency but also amplifying biases that affect equity in access, exposure, and opportunity. This study introduces the FAIRS (&#x2018;Fair Algorithms for Information Retrieval and Seeking&#x2019;) framework to address the pressing need for a comprehensive conceptualisation of algorithmic fairness in the context of information access.</p>
<p><bold>Method.</bold> We build on a PRISMA-based literature review on scholarship relevant to algorithmic fairness and information access published between 2015 and 2025. The intersecting themes from over 100 peer-reviewed articles were triangulated to develop a conceptual framework.</p>
<p><bold>Analysis.</bold> Thematic synthesis iteratively mapped themes connecting algorithmic fairness and information access across user roles, technologies, fairness issues, dimensions, solutions, metrics, bias, and contextual factors. These themes form the foundation of the FAIRS conceptual design.</p>
<p><bold>Results.</bold> Existing research focuses on fairness in classification and rank-based personalisation. We determined that a comprehensive model of algorithmic fairness in information access must integrate metrics, context, barriers, technology, bias, fairness dimensions, and user perspectives&#x2014;core components reflected in FAIRS.</p>
<p><bold>Conclusions.</bold> FAIRS offers a novel, context-sensitive approach for defining, assessing, and operationalising fairness in information access. It provides a foundation for new fairness models, clarifies trade-offs, and supports the creation of holistic, equitable, and ethically grounded information systems.</p>
</abstract>
</article-meta>
</front>
<body>
<sec id="sec1">
<title>Introduction</title>
<p>Artificial intelligence (AI) and machine learning (ML) increasingly shape online and public sector domains by enhancing efficiency, accuracy, and productivity while potentially mitigating human bias while reproducing and amplifying biases embedded in their training data, resulting in inequitable outcomes such as biased opportunity allocation, skewed search rankings, and information disparities (<xref ref-type="bibr" rid="R41">Gao &#x0026; Shah, 2021</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>). Consequently, issues of privacy, accountability, equity, inclusion, and informed consent in automated decision&#x2013;making become more complex, underscoring the urgent need to ensure algorithmic fairness and minimise bias.</p>
<p>Adoption of AI and ML also varies across regions and communities (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>), shaped by global and national geopolitical dynamics (<xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). Internet governance policies and the inherent structures of AI/ML systems can perpetuate digital divides and other inequalities in information access (<xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). Thus, algorithmic fairness has emerged as a central concern in aligning technological advancement with ethical governance (<xref ref-type="bibr" rid="R106">Sonnenberg, 2020</xref>).</p>
<p>Despite growing attention, the literature lacks consensus on what constitutes &#x2018;algorithmic fairness&#x2019; in the context of information access. This paper fills that gap by addressing the following research questions (RQs):</p>
<list list-type="simple">
<list-item><p>RQ1: What does algorithmic fairness mean in the context of information access?</p></list-item>
<list-item><p>RQ2: What themes and concepts should form the core of a comprehensive conceptualisation of algorithmic fairness in the context of information access?</p></list-item>
</list>
<p>Using a systematic (PRISMA-based) literature review (<xref ref-type="bibr" rid="R88">Page et al., 2021</xref>), we identify and synthesise key themes linking algorithmic fairness and information access to form the foundation of a conceptual framework. <xref ref-type="bibr" rid="R31">Ekstrand et al. (2022)</xref> reviewed fairness issues in information access systems, focusing primarily on user&#x2013;item trade-offs despite acknowledging multiple stakeholders.</p>
<p>This paper proposes FAIRS (&#x2018;Fair Algorithms for Information Retrieval and Seeking&#x2019;), a conceptual framework that integrates fairness at the design stage of information systems, rather than assessing it post-deployment. FAIRS also offers guiding questions for embedding fairness principles throughout system development and evaluation while emphasising that fairness is normative and context dependent.</p>
</sec>
<sec id="sec2">
<title>Literature review</title>
<sec id="sec2_1">
<title>Literature search</title>
<p>Building on our earlier PRISMA review (<xref ref-type="bibr" rid="R111">Udoh, Yuan, &#x0026; Rorissa, 2022</xref>), we revised our initial search query and expanded our search to include additional databases, including those that have become key venues for publishing on information access and algorithmic fairness. We used predetermined keywords with the query: Information AND (retriev* OR system*) AND (search* OR engine) AND Fair* AND &#x201C;Information access.&#x201D;</p>
<p>We searched eight databases in three rounds, limiting our inclusion to peer-reviewed full-text articles published from 2015 to 2025, written in English, and relevant to algorithmic fairness and information access. Titles and abstracts were screened using the predetermined inclusion/exclusion criteria, and the full texts of selected articles were reviewed to ensure they met these criteria.</p>
<p>From the initial collection of 635 articles, we removed 164 duplicates, resulting in 471 unique sources. The authors independently screened the titles and abstracts of these articles, removing 359 that were irrelevant to the review, selecting 112 articles for further screening, and including 103 in the final sample. <xref ref-type="fig" rid="F1">Figure 1</xref> summarises the search results and workflow for the literature search.</p>
<fig id="F1">
<label>Figure 1.</label>
<caption><p>PRISMA literature search workflow.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="c16-fig1.jpg"><alt-text>none</alt-text></graphic>
</fig>
<p>Algorithmic fairness in information access has emerged as a central concern for information research, while remaining conceptually fragmented across technical, legal, and socio-cultural domains (<xref ref-type="bibr" rid="R112">Udoh et al., 2024</xref>). This fragmentation undermines the field&#x2019;s ability to evaluate and design systems that equitably mediate access to information, opportunities, and social participation (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>). We synthesise recent PRISMA-based scholarship on algorithmic fairness and information access to examine key concepts, stakeholders, metrics, solutions, and their application in core technologies. These strands reveal a pressing need for a comprehensive, information-access&#x2013;specific definition of algorithmic fairness that can support cumulative research and practice.</p>
</sec>
<sec id="sec2_2">
<title>Dimensions of fairness</title>
<p>The literature converges on the view that AI/ML fairness is a multidimensional construct, though the dimensions are treated in isolation. A foundational distinction is between individual (that seeks to ensure that similar individuals are treated similarly) and group (focuses on comparable outcomes for socially salient groups defined by protected attributes such as gender, race, or disability) fairness (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; <xref ref-type="bibr" rid="R29">Dwork et al., 2012</xref>). Another recurring distinction is between fairness in treatment (intentional differentiation) and fairness in impact (which captures unintended but systematically unequal outcomes) (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>). In algorithmic contexts, these are typically operationalised via statistical parity and related measures, which assess whether decisions or exposure to information are independent of group membership (<xref ref-type="bibr" rid="R38">Friedler et al., 2021</xref>). These concepts highlight that fairness cannot be reduced to the absence of explicit discrimination; instead, the distributional effects of ranking and recommendation policies should be considered.</p>
<p>The literature also identifies several further dimensions relevant to information research. Internet or &#x2018;net&#x2019; neutrality concerns equitable access to online content and services, requiring that providers avoid blocking, throttling, or prioritising specific sites or applications (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>). Network fairness examines whether users or applications receive a fair share of system resources and how network position can confer self-reinforcing advantages (<xref ref-type="bibr" rid="R113">Venkatasubramanian et al., 2021</xref>). Fairness in ranking and exposure focuses on how search and recommendation systems allocate visibility and attention, explicitly recognising that exposure is a resource (<xref ref-type="bibr" rid="R4">Balagopalan et al., 2023</xref>; <xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>). Finally, legal and policy dimensions of fairness are anchored in accessibility protections, such as Section 508 in the United States (U.S.), and cross-national regulatory comparisons (<xref ref-type="bibr" rid="R106">Sonnenberg, 2020</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>).</p>
<p>These dimensions point to fairness as a layered construct encompassing equal treatment and impact, exposure and resource allocation, infrastructural conditions (net and network neutrality), and compliance with accessibility and anti-discrimination regimes. However, these layers rarely are integrated into a unified conceptualisation specific to information access.</p>
</sec>
<sec id="sec2_3">
<title>Fairness issues and contexts involved</title>
<p>Algorithmic fairness spans multiple, interrelated issues across information systems, including bias, inclusion, network neutrality, and the broader harms of automated decision-making such as stereotyping, misrepresentation, and disenfranchisement. These concerns arise in contexts like internet access, search and recommendation systems, information quality, digital literacy, and metadata practices.</p>
<p>Inclusion remains a central challenge, particularly in equitable access to digital resources. Algorithmic filtering and prioritisation can undermine network neutrality and restrict access (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). Persistent disparities affect older adults, people with disabilities, and marginalised populations, reflecting gaps in both access and digital literacy, especially in developing regions (<xref ref-type="bibr" rid="R44">Gebremichael &#x0026; Jackson, 2006</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>).</p>
<p>Result diversity highlights how systems often reproduce dominant perspectives due to biased data and design. For instance, although women comprise 28% of U.S. chief executive officers (CEOs), they appear in only 10% of Google Image results for &#x201C;CEO&#x201D; (<xref ref-type="bibr" rid="R59">Kay et al., 2015</xref>). Efforts such as diversity-aware summarisation aim to mitigate this (<xref ref-type="bibr" rid="R15">Celis &#x0026; Keswani, 2020</xref>), yet disparities persist, including in multilingual retrieval, where Bantu-language speakers may experience worse performance than English speakers (<xref ref-type="bibr" rid="R17">Chavula &#x0026; Hussein, 2016</xref>).</p>
<p>Network fairness and net neutrality address how infrastructure and policy shape equitable access. Unequal network structures can amplify disparities through feedback loops, while policy debates, such as U.S. net neutrality, demonstrate how access to essential information, including healthcare, can be constrained (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>; <xref ref-type="bibr" rid="R113">Venkatasubramanian et al., 2021</xref>).</p>
<p>Algorithmic systems also shape visibility and opportunity through ranking and recommendation. Biases may stem from training data (exogenous) or broader systemic conditions (endogenous), producing allocational and representational harms (<xref ref-type="bibr" rid="R11">Blodgett et al., 2020</xref>; <xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>). These dynamics align with concerns about algorithmic oppression, where systems reproduce inequality through mechanisms like stereotyping and redlining.</p>
<p>Bias and stereotyping persist due to unrealistic assumptions, such as completely protected&#x2013;attribute data, and flawed modelling choices that skew exposure (<xref ref-type="bibr" rid="R41">Gao &#x0026; Shah, 2021</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>; Kirnap et al., 2021 ). Inequities are compounded by differences in readability and information quality, disproportionately affecting users with lower digital literacy, disabilities, or age-related barriers (<xref ref-type="bibr" rid="R53">Hamwela et al., 2018</xref>; <xref ref-type="bibr" rid="R78">McKearney et al., 2018</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). Privacypreserving behaviour may also lead to less dependable or more extreme recommendations (<xref ref-type="bibr" rid="R107">Spinelli &#x0026; Crovella, 2020</xref>).</p>
<p>Accountability and transparency remain difficult to standardise. Fairness is measured through computational metrics, while accountability and transparency rely on audits and user studies, prompting efforts to develop clearer evaluative frameworks (Bernard &#x0026; Balog, 2023). Interpretability adds another dimension: users frequently disagree with system outputs, for example, 81% disagreed with Alexa&#x2019;s top result in one study, highlighting the gap between system logic and user expectations (<xref ref-type="bibr" rid="R24">Dash et al., 2022</xref>).</p>
<p>Overall, fairness in information systems extends beyond accuracy to include equitable access, representation, interpretability, and the distribution of informational benefits and harms.</p>
</sec>
<sec id="sec2_4">
<title>Stakeholders involved</title>
<p>The reviewed literature increasingly adopts stakeholder and multi-stakeholder perspectives, emphasising that those most affected by algorithmic systems should participate in their governance (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>). Studies of patient-facing health information highlight misalignments between the content and presentation of online resources and the preferences and capacities of people with chronic conditions, such as low back pain, signalling the need for participatory design and evaluation (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R78">McKearney et al., 2018</xref>).</p>
<p>Stakeholders identified include technology firms, regulators, researchers, educators, librarians, civil society organisations, and end users, particularly marginalised communities such as people with disabilities, older adults, and users with lower literacy (<xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). In recommender systems, <xref ref-type="bibr" rid="R105">Sonboli et al. (2022)</xref> articulate a multi-stakeholder framework that distinguishes between consumer fairness (users), item fairness (content providers), and platform fairness (system operators), and argue that fairness objectives must be negotiated among these groups rather than specified unilaterally.</p>
<p>Within the information research community, librarianship and media ecosystems are positioned as active stakeholders in fairness. Critical librarianship initiatives call for exposing subject-heading bias, teaching search engine bias, and curating social-justice-oriented guides, while credibility models for news communities leverage interaction graphs to identify trustworthy sources and &#x2018;citizen journalists&#x2019; (<xref ref-type="bibr" rid="R5">Bains, 2020</xref>; <xref ref-type="bibr" rid="R82">Mukherjee &#x0026; Weikum, 2015</xref>). These strands suggest that algorithmic fairness in information access is not a purely technical property of systems, but also involves professional practice, governance, and collective responsibility.</p>
</sec>
<sec id="sec2_5">
<title>Fairness metrics and frameworks used</title>
<p>Fairness metrics in information access have evolved from simple decision-level measures to more nuanced, exposure&#x2013;oriented, and context-sensitive frameworks. In ranking contexts, <xref ref-type="bibr" rid="R26">Diaz et al. (2020)</xref> define fairness as equal expected exposure for items, (or groups, of equal relevance, explicitly accounting for position bias and user attention. <xref ref-type="bibr" rid="R61">K&#x0131;rnap et al. (2021)</xref> introduce unbiased estimators for fair ranking metrics that address incomplete judgments and logging bias, enabling more accurate evaluation of exposure fairness under realistic data constraints.</p>
<p>Beyond specific metrics, researchers propose frameworks for evaluating fairness in ranked lists. Sakai and colleagues advance group fairness and relevance (GFR) measures that manage nominal and ordinal groups, as well as soft group membership, and quantify how far exposure distributions depart from fairness targets (<xref ref-type="bibr" rid="R100">Sakai et al., 2023</xref>). Complementing this, Bernard and Balog (2023) provide a systematic review of fairness, accountability, transparency, and ethics in information retrieval and conclude that the field lacks standard definitions and calls for taxonomies of requirements that can be operationalised in evaluation (Bernard &#x0026; Balog, 2023).</p>
<p>Where explicit protected attributes are unavailable, estimation and auditing approaches have been proposed. Quantification-based estimators approximate group composition and adjust outputs to promote fairer distributions, while counterfactual auditing evaluates whether individual-level outcomes change under hypothetical modifications to sensitive attributes (<xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>; <xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>). In recommender systems, multi-stakeholder fairness frameworks define distinct metrics for consumer, item, and platform fairness, and axiomatic models specify desired fairness properties for ranking systems, including search and job recommendations (<xref ref-type="bibr" rid="R49">Giner, 2023</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>).</p>
<p>These developments underscore that fairness is increasingly measured at the level of exposure and attention, but that metric design is shaped by assumptions about context, group definitions, and stakeholder priorities. This reinforces the need for an overarching conceptualisation that clarifies how different metric families relate to each other in information access settings.</p>
</sec>
<sec id="sec2_6">
<title>Algorithmic fairness solutions proffered</title>
<p>The identified algorithmic harms centre on inclusion and equity across protected characteristics such as race, gender, age, religion, national origin, marital status, socioeconomic status, and proxy variables like location.</p>
<p>Proposed solutions address fairness in search, retrieval, and recommendation systems through agnostic ranking models (<xref ref-type="bibr" rid="R1">Ai et al., 2023</xref>; <xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>; <xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>; <xref ref-type="bibr" rid="R97">Rieger et al., 2024</xref>), distribution-aware recommender systems (<xref ref-type="bibr" rid="R32">Ekstrand et al., 2024</xref>; <xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>), diversity and multi-sided exposure methods (<xref ref-type="bibr" rid="R4">Balagopalan et al., 2023</xref>; <xref ref-type="bibr" rid="R25">Dhaliwal et al., 2021</xref>; <xref ref-type="bibr" rid="R42">Gao et al., 2022</xref>; <xref ref-type="bibr" rid="R43">Gao &#x0026; Shah, 2020</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>; <xref ref-type="bibr" rid="R117">Wu et al., 2022</xref> ), image summarisation diversity (<xref ref-type="bibr" rid="R15">Celis &#x0026; Keswani, 2020</xref>), and pairwise fairness measures (<xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>).</p>
<p>Model-based approaches address bias directly. For example, AdvBERT uses adversarial learning to remove protected attributes while preserving relevance, though proxy variables, such as location for race, can still reintroduce bias (<xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>). Counterfactual auditing methods, such as PRET, instead assess fairness by testing outcome changes under altered sensitive attributes (<xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>).</p>
<p>Several fairness interventions engage librarianship and media ecosystems to preserve fairness and facts in the face of misinformation and disinformation. Critical librarianship calls for naming subject-heading bias, teaching search-engine bias, and curating social-justice guides, while credibility models for news communities infer credible articles, trustworthy sources, and expert &#x2018;citizen journalists&#x2019; from interaction graphs (<xref ref-type="bibr" rid="R5">Bains, 2020</xref>; <xref ref-type="bibr" rid="R82">Mukherjee &#x0026; Weikum, 2015</xref>).</p>
<p>Preprocessing decisions and evaluation strategies further shape fairness outcomes. Metadata decisions significantly affect information retrieval (IR) performance, while randomised evaluation and optimisation frameworks promote equal expected exposure and parity of attention (<xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R99">Roy et al., 2018</xref>). Several solutions focus on preserving fairness at the resource ranking level in search engines, including uncertainty-aware retrieval and unbiased estimation of fairness metrics from sparse labels, and improved tag recommendation using topic models (<xref ref-type="bibr" rid="R51">Guiver &#x0026; Snelson, 2008</xref>; Kirnap et al., 2021; <xref ref-type="bibr" rid="R66">Krestel et al., 2009</xref>).</p>
<p>Accountability and transparency are advanced through system design and auditing. For instance, IBM&#x2019;s CLEVER (Continuous Learning for Evolving and Verifiable Embodied Representations) search system provides visibility into ranking pipelines, building on Kleinberg&#x2019;s (1999) HITS (or Hypertext Induced Topic Search) algorithm framework, while broader efforts combine audits and user studies to evaluate fairness (<xref ref-type="bibr" rid="R68">Kumar et al., 2006</xref>).</p>
<p>Another group of solutions that aim to ensure the fairness of algorithms within search engines includes cluster-based retrieval for improved access (<xref ref-type="bibr" rid="R69">Lamprier et al., 2010</xref>), spam-resilient ranking (<xref ref-type="bibr" rid="R28">Du et al., 2007</xref>), and fairness in advertising mechanisms such as keyword bidding (<xref ref-type="bibr" rid="R95">Rey &#x0026; Kannan, 2010</xref>).</p>
<p>Context-aware and user-centred approaches further refine fairness, including models that incorporate task context, can better infer user intent to retrieve relevant and valuable information (<xref ref-type="bibr" rid="R64">Koskela et al., 2018</xref>), while search behaviour (e.g., literature search and data seeking) is more closely intertwined than previous literature suggests (Kramer et al., 2021).</p>
<p>Several sources frame fairness in terms of inclusion and accessibility to resources for people with disabilities. These accessibility solutions range from early communications stations for blind users (<xref ref-type="bibr" rid="R93">Rahimi &#x0026; Eulenberg, 1974</xref>) to modern legal and policy audits of government compliance with Section 508 (<xref ref-type="bibr" rid="R106">Sonnenberg, 2020</xref>), and cross-national comparisons of the rules and laws of Internet accessibility protections, and calls for stronger private-sector accessibility mandates (<xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). Mobile and geospatial systems also enhance equitable access through integrated, location-based services (<xref ref-type="bibr" rid="R108">Sun et al., 2017</xref>).</p>
<p>Sociotechnical interventions also address misinformation and bias through critical librarianship and credibility modelling in news ecosystems (<xref ref-type="bibr" rid="R5">Bains, 2020</xref>; <xref ref-type="bibr" rid="R82">Mukherjee &#x0026; Weikum, 2015</xref>). Fairness&#x2013;aware rank fusion methods, such as WISE Fusion, aim to ensure proportional or equal representation in high-stakes contexts like hiring (<xref ref-type="bibr" rid="R14">Cachel &#x0026; Rundensteiner, 2024</xref>), much more than the fairness and utility performance of state-of-the-art methods.</p>
<p>These interventions show that achieving fairness in information access in practice requires coordinated technical, evaluative, and institutional strategies.</p>
</sec>
<sec id="sec2_7">
<title>Fairness and access technologies involved</title>
<p>Search engines, information retrieval systems, recommender systems, ranking algorithms and mechanisms, and websites are among information access technologies relevant to the discussion of algorithmic fairness.</p>
<p>In information access systems, fairness concerns whether benefits and resources are distributed equitably across separate groups (<xref ref-type="bibr" rid="R30">Ekstrand, Burke, &#x0026; Diaz, 2019</xref>; <xref ref-type="bibr" rid="R56">Jeong, 2006</xref>). Fairness concerns could be raised regarding the algorithm, the data they utilise to produce results, the output, or the search results (Makri et al., 2021), and interfaces such as graphical displays used by visually impaired or blind users (<xref ref-type="bibr" rid="R56">Jeong, 2006</xref>). The potential for bias in search engines is significant, from the introduction or embedding of &#x2018;social, political, and moral values in their ranking functions&#x2019; (<xref ref-type="bibr" rid="R30">Ekstrand, Burke, &#x0026; Diaz, 2019</xref>, p. 7) to biased crawling and indexing, where webpages in specific languages could be under-indexed. Therefore, any solutions to algorithmic fairness issues in information access must directly address factors relevant to these technologies, including developing and applying fairness metrics that assess web usability, readability, and quality (<xref ref-type="bibr" rid="R53">Hamwela, Ahmed, &#x0026; Bath, 2018</xref>; <xref ref-type="bibr" rid="R78">McKearney et al., 2018</xref>), and are pivotal in objectively evaluating the fairness of search system ranking decisions (Kirnap et al., 2021; <xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>).</p>
<p>The two major sectors directly impacted are online retail and streaming services, where the influence of issues such as biased training data on the fairness of these technologies is substantial (<xref ref-type="bibr" rid="R57">Joachims, 2021</xref>). The heightened scrutiny around search engines and fairness issues has prompted some to propose fairness evaluation metrics that consider protected attributes like gender or ethnicity (Kirnap et al., 2021), while others (<xref ref-type="bibr" rid="R107">Shah &#x0026; Bender, 2024</xref>) advocate for reassessing the core information retrieval research focus to adequately address the tremendous impact algorithmic decision systems have on information access, individuals, and society. It suggests that algorithmic fairness cannot be fully understood without considering the interplay of data, algorithms, interfaces, and user characteristics across the entire information access pipeline.</p>
</sec>
<sec id="sec2_8">
<title>Information access fairness</title>
<p>The literature explicitly connects algorithmic fairness to broader notions of information access as a human right rooted in equality, justice, and non-discrimination (<xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>). As AI and ML systems increasingly shape how individuals and communities search for, encounter, and interpret information, fairness in these systems becomes a prerequisite for equitable participation in knowledge production, public discourse, and everyday life (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R73">Li et al., 2014</xref>).</p>
<p>However, fairness is currently conceptualised through multiple, partially overlapping lenses: statistical parity and disparate impact; exposure equality and diversity; accessibility and disability rights; stakeholder participation and commonsense expectations; and socio-technical accountability and transparency (<xref ref-type="bibr" rid="R7">Bauer &#x0026; Schiele, 2024</xref>; Bernard &#x0026; Balog, 2023). While this diversity reflects the multidimensional nature of fairness, it also creates a fragmented landscape in which definitions, metrics, and interventions are difficult to compare and aggregate.</p>
<p>Thus, while information research has developed rich work on specific fairness dimensions, metrics, and solutions, it lacks a comprehensive, field&#x2013;specific definition of or a conceptual framework for algorithmic fairness in the context of information access (<xref ref-type="bibr" rid="R112">Udoh et al., 2024</xref>). Developing and debating such a framework within the Information Research community would support more coherent evaluation, design, and governance of information access systems in an increasingly algorithmic world.</p>
</sec>
<sec id="sec2_9">
<title>FAIRS: A framework for rethinking algorithmic fairness in the context of information access</title>
<p>Several overlapping and intersecting themes emerged from the previous section, and we triangulated those findings with current themes not captured in the review. Again, the overlapping/emerging themes form the foundation for FAIRS (&#x2018;Fair Algorithms for Information Retrieval and Seeking&#x2019;) that conceptualises algorithmic fairness in the context of information access (<xref ref-type="fig" rid="F2">Figure 2</xref>). We present the framework before discussing crucial concepts that should constitute any conceptualisation of algorithmic fairness in the context of information access.</p>
<fig id="F2">
<label>Figure 2.</label>
<caption><p>The FAIRS framework for conceptualising algorithmic fairness in the context of information access. Source: Authors&#x2019; work.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="c16-fig2.jpg"><alt-text>none</alt-text></graphic>
</fig>
</sec>
<sec id="sec2_10">
<title>Bias</title>
<p>Bias appears in the literature as a pervasive, overlapping theme that links data practices, modelling choices, and power relations in information access systems. It manifests in stereotyping, redlining, disenfranchisement, and &#x2018;dirty&#x2019; or biased data, often through imbalances in user and item data, content production, and interaction logs that feed retrieval, ranking, and evaluation models (<xref ref-type="bibr" rid="R37">Ferguson, 2017</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R96">Richardson et al., 2019</xref>). Scholars argue that algorithmic systems rely on flawed assumptions, such as that data accurately reflects reality, that the future mirrors the past, and that algorithms are neutral, despite significant human judgment shaping their design and outcomes (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; Moses &#x0026; Chan, 2016; <xref ref-type="bibr" rid="R102">Selbst et al., 2019</xref>).</p>
<p>This work converges on the view of bias as socio-technical: preexisting in institutions and hierarchies, technical in design and implementation, and emergent in use (<xref ref-type="bibr" rid="R21">Crawford, 2016</xref>; <xref ref-type="bibr" rid="R39">Friedman &#x0026; Nissenbaum, 1996</xref>; <xref ref-type="bibr" rid="R67">Kroll et al., 2017</xref>). Moreover, algorithms align with and advance ideological worldviews (<xref ref-type="bibr" rid="R8">Beer, 2009</xref>, <xref ref-type="bibr" rid="R9">2013</xref>; <xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R40">Fuller &#x0026; Goffey, 2012</xref>; <xref ref-type="bibr" rid="R75">Mackenzie, 2015</xref>).</p>
<p>Algorithmic systems both personalise and sort while also enabling discrimination, exclusion, and the reinforcement of racialised and gendered orders, as documented in search engines, social media feeds, and recommender systems (<xref ref-type="bibr" rid="R8">Beer, 2009</xref>; <xref ref-type="bibr" rid="R46">Gillespie, 2014</xref>, <xref ref-type="bibr" rid="R9">2019</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R91">Pasquale, 2015</xref>; <xref ref-type="bibr" rid="R110">Tufekci, 2015</xref>). In information access specifically, this includes representational harms such as misrepresentation and stereotyping, as well as allocative harms tied to unequal exposure and opportunity, including in criminal justice and credit scoring (<xref ref-type="bibr" rid="R37">Ferguson, 2017</xref>; <xref ref-type="bibr" rid="R89">Pariser, 2012</xref>; <xref ref-type="bibr" rid="R96">Richardson et al., 2019</xref>; <xref ref-type="bibr" rid="R117">Wu et al., 2022</xref>). For example, the same search query entered by three users, each from a different continent at the same time, tends to produce different sets or orders of results.</p>
<p>Across these strands, concerns about &#x2018;algocracy&#x2019; foreground how hiddenness and opacity in data collection, modelling, and deployment undermine accountability, enabling algorithmic systems to act as de facto arbiters of public relevance and legitimacy (<xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R67">Kroll et al., 2017</xref>; <xref ref-type="bibr" rid="R92">Peter, 2017</xref>; <xref ref-type="bibr" rid="R102">Selbst et al., 2019</xref>). The resulting picture, which FAIRS adopts, treats bias not as a purely statistical artifact but as a structuring condition of contemporary information ecosystems that must be confronted through contextual, multi-level interventions in data, models, interfaces, and institutions (<xref ref-type="bibr" rid="R21">Crawford, 2016</xref>; <xref ref-type="bibr" rid="R39">Friedman &#x0026; Nissenbaum, 1996</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R91">Pasquale, 2015</xref>).</p>
</sec>
<sec id="sec2_11">
<title>The user</title>
<p>The user is a key stakeholder in evaluating algorithmic fairness. In the context of information access, the question is &#x2018;Fair to whom?&#x2019; To whom should the algorithmic decision system be fair? And how much is fair enough?</p>
<p>In different application domains of algorithmic systems, users face different fairness challenges. In job and candidate seeking search, whether the user receives a fair set of job opportunities in the recommendations or ads in their feed, whether the match or fit score is a fair score, does not redline or overvalue some candidates, whether the candidates have fair visibility when recruiters filter for top candidates (<xref ref-type="bibr" rid="R45">Geyik &#x0026; Kenthapadi, 2018</xref>), and what fairness concerns come from regulatory requirements or procedures. Similarly, fairness in discoverability also directly impacts users&#x2019; news and music discoverability. For example, do the music and news items receive fair exposure and visibility across topics and genres, are users exposed to diverse content regardless of demographics or location, and are recommendations and search results free from biases affecting both users and creators (<xref ref-type="bibr" rid="R33">Epps-Darling, Bouyer, &#x0026; Cramer, 2020</xref>)? The point is, &#x2018;News search and recommendation influences user exposure to news articles on social media, news aggregation applications, and search engines&#x2019; (<xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>, p. 12). This tends to place users in filter bubbles, exposing them primarily to news items that reinforce their beliefs and deepen ideological polarisation (<xref ref-type="bibr" rid="R3">Alstyne &#x0026; Brynjolfsson, 2005</xref>; Pariser, 2011). The bottom line is that information access systems ought to meet various objectives for multiple stakeholders.</p>
</sec>
<sec id="sec2_12">
<title>The information access technology involved</title>
<p>Fairness discussions in information access also need to consider the various technologies involved, including search engines, information retrieval systems, recommender systems, ranking algorithms, and web&#x2013;based interfaces as the core infrastructures through which algorithmic fairness issues materialise (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R76">Makri et al., 2021</xref>). These systems are consistently framed as socio-technical pipelines, spanning crawling and indexing, learning-to-rank, personalisation, and interface design, whose design choices embed social, political, and moral values and can systematically skew exposure and opportunity across groups (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>; Kirnap et al., 2021; <xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>). A substantial subset of studies highlights modality- and context&#x2013;specific access technologies, including assistive interfaces, mobile platforms, and large language model (LLM)-based systems, demonstrating how accessibility constraints, biased training data, and under-indexing of particular languages or regions exacerbate digital divides and representational harms (<xref ref-type="bibr" rid="R17">Chavula &#x0026; Suleman, 2016</xref>; <xref ref-type="bibr" rid="R56">Jeong, 2006</xref>; <xref ref-type="bibr" rid="R103">Schmidt et al., 2010</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>).</p>
<p>Collectively, this work motivates FAIRS&#x2019; treatment of information access technologies as a unifying axis in the literature, linking concrete systems and interfaces to fairness metrics, evaluation methods, and governance interventions that seek to ensure equitable exposure, usability, and information quality for diverse users and content providers (<xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R53">Hamwela et al., 2018</xref>; <xref ref-type="bibr" rid="R78">McKearney et al., 2018</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>).</p>
</sec>
<sec id="sec2_13">
<title>Fairness</title>
<p>Algorithmic fairness debates still hinge on which conception of fairness is assumed and what counts as &#x2018;fair enough&#x2019; in applied settings, especially given the dominance of Euro-American legal and statistical traditions (<xref ref-type="bibr" rid="R101">Sambasivan et al., 2020</xref>; <xref ref-type="bibr" rid="R112">Udoh et al., 2024</xref>). Recent work argues for treating fairness as a realistic sufficiency threshold rather than an ideal of perfection, emphasising context-sensitive standards against which complex information access systems can be evaluated and governed (<xref ref-type="bibr" rid="R31">Ekstrand, 2022</xref>, <xref ref-type="bibr" rid="R32">2024</xref>; <xref ref-type="bibr" rid="R101">Sambasivan et al., 2020</xref>). Drawing on FAIRS, we conceptualise algorithmic fairness as a multidimensional responsibility structure in which accountability, transparency, safety, privacy, and ethics specify interrelated but analytically distinct conditions for responsible information access (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>).</p>
<p>Fairness as accountability links measured disparities in exposure, error, or relevance to concrete mechanisms for traceability, audit, and redress, making fairness metrics and audits actionable governance tools rather than purely diagnostic instruments (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R31">Ekstrand, 2022</xref>; <xref ref-type="bibr" rid="R102">Selbst et al., 2019</xref>). Fairness as transparency concerns the scrutability of system purposes, data flows, and optimisation logics for affected stakeholders, including intelligible explanations of decisions, objectives, and trade-offs; without such transparency, neither informed consent nor meaningful contestation of unfair outcomes is possible (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R52">Guo et al., 2023</xref>; <xref ref-type="bibr" rid="R112">Udoh et al., 2024</xref>).</p>
<p>Fairness as safety foregrounds obligations to anticipate, mitigate, and monitor informational harms, such as exposure to misinformation, discriminatory content, or unsafe recommendations, by integrating harm-sensitive objectives and pessimistic or worst-case evaluation methods that emphasise the most vulnerable users and providers rather than aggregate utility (<xref ref-type="bibr" rid="R27">Diaz, 2024</xref>; <xref ref-type="bibr" rid="R116">White &#x0026; Hassan, 2014</xref>). Fairness as privacy highlights how unequal exposure to data collection, profiling, and inference constitutes an unfair burden, positioning privacy both as a constraint on fairness interventions and as a dimension of fairness concerned with whose data, queries, and interaction histories are most heavily exploited (<xref ref-type="bibr" rid="R2">Akter et al., 2020</xref>; <xref ref-type="bibr" rid="R112">Udoh et al., 2024</xref>).</p>
<p>Finally, fairness as ethics provides the normative grounding that connects these sub concepts to broader commitments to non-discrimination, equity, and respect for persons, extending beyond mere compliance toward critical reflection on how information access systems reproduce or resist structural injustices and representational harms (<xref ref-type="bibr" rid="R50">Gotterbarn et al., 2018</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>).</p>
<p>Synthesising these strands, we define algorithmic fairness in the information access domain as:</p>
<disp-quote>
<p><italic>Algorithmic fairness in the domain of information access is the context&#x2013;sensitive responsibility of information systems to allocate exposure, relevance, and opportunities in ways that (1) avoid unjust, systematic disadvantages to individuals or groups, and (2) satisfy interrelated requirements of accountability, transparency, safety, privacy, and ethics across the system&#x2019;s data, models, interfaces, and governance. ---1</italic></p>
</disp-quote>
</sec>
<sec id="sec2_14">
<title>Barriers to fair access</title>
<p>Some barriers to algorithmic fairness include historical and persistent discrimination, censorship, content divide, disproportionate access to infrastructure, deliberate digital misrepresentation, disparate distribution of content, insufficient legislation and regulation, and lack of net neutrality. Discussions on algorithmic fairness in information access must pay special attention to the fact that some groups are more susceptible to these barriers than others. In the United States, there is a long history of discrimination against black and minority groups dating back to the county poorhouses of the 19th century (<xref ref-type="bibr" rid="R34">Eubanks, 2018</xref>). These surreptitious redlining activities persist online through the opaque algorithmic ranking, sorting, and recommendation systems.</p>
</sec>
<sec id="sec2_15">
<title>Fairness metrics</title>
<p>The metrics used to determine what and how much is fair in the context of information access also need to be considered. There needs to be greater transparency about the sampling strategies used to determine who is included in the dataset, accompanied by detailed codebooks that not only define the variables but also specify how each variable is recorded, particularly for categorical variables. The selection and definition of variables are crucial, as observations or proxies must be valid and unbiased measures of the target construct to avoid measurement bias. A codebook reflects specific perspectives on how observations should be recorded or coded, which is extremely important in contexts where protected and personal variables are used.</p>
<p>Considering group fairness, group size, or the amount of representation can also contribute to unfairness (<xref ref-type="bibr" rid="R98">Rolf et al., 2021</xref>), because naive modelling is likely to be more accurate at predicting the majority group than the minority groups. This is often the root of representational or distributional harms online, where more data and examples from dominant geographical and cultural environments are used to train algorithms for filtering, recommendation, and ranking, and to determine how much exposure a resource gets and who has more access to it.</p>
</sec>
<sec id="sec2_16">
<title>The context of implementation</title>
<p>Technologies do not exist in a vacuum; they are deployed in domains and environments coloured by culture, politics, economics, legal and policy framework, and social norms, among others. Therefore, fairness discourses in the context of information access need to focus on implementation contexts as well. Despite the pervasiveness of the Internet, net neutrality is not a common feature across all geopolitical zones, as policies, laws, and guidelines govern Internet use, digital information searches, and access to information. With censorship, for instance, entire groups and countries are denied unfettered access to Internet resources. In contrast, some geopolitical regions have no say in how digital resources are distributed and must contend not only with a digital divide but also a content divide.</p>
<p>Similarly, input data and the algorithmic decision results need to be collected and interpreted, considering the data&#x2019;s social and cultural context to avoid unfairly disregarding local knowledge, perspectives, societal norms, mores, and ethos, as well as bias. A vital direction would be to focus on the entire data pipeline, as each point in the pipeline is a potential vulnerability to unfairness and unfair access practices.</p>
</sec>
</sec>
<sec id="sec3">
<title>Discussion</title>
<p>Drawing on our previous work, we propose FAIRS, a framework for rethinking and studying the intersection of algorithmic fairness and information access.</p>
<p>Algorithmic fairness in information access is best understood as a multidimensional, contextsensitive responsibility of sociotechnical systems rather than a single technical property or metric (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>). Building on our PRISMA-based review and the conceptual synthesis presented earlier, this section interprets what FAIRS contributes, where its boundaries lie, and which tensions and open questions it surfaces for future work (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R88">Page et al., 2021</xref>).</p>
<sec id="sec3_1">
<title>Interpreting FAIRS as a responsibility structure</title>
<p>Most work on algorithmic fairness in information access has evolved around classification and rank-based personalisation, typically operationalised through group and individual fairness metrics, exposure constraints, and multi-stakeholder trade-offs (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; <xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R29">Dwork et al., 2012</xref>; <xref ref-type="bibr" rid="R49">Giner, 2023</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>). FAIRS reframes fairness not merely as a distributional outcome, but as a responsibility structure that spans data, models, interfaces, and governance (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>). This shift echoes philosophical accounts that treat algorithmic fairness as an institutional obligation to avoid unjustified differential treatment and impact, rather than as a purely statistical criterion (<xref ref-type="bibr" rid="R114">Wachter &#x0026; Mittelstadt, 2019</xref>).</p>
<p>First, FAIRS integrates bias, user roles, technologies, barriers, metrics, and implementation context into a single conceptual map, thereby countering the fragmentation that separates &#x2018;fairness in ranking,&#x2019; &#x2018;accessibility,&#x2019; and &#x2018;policy/regulation&#x2019; into parallel but rarely connected discourses (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R106">Sonnenberg, 2020</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>). <xref ref-type="bibr" rid="R31">Ekstrand et al. (2022)</xref> emphasise stakeholder and exposure trade-offs in information access; <xref ref-type="bibr" rid="R102">Selbst et al. (2019)</xref> foreground sociotechnical abstraction; and <xref ref-type="bibr" rid="R13">Burke (2017)</xref> distinguishes consumer&#x2013; and provider-side fairness in recommender systems. FAIRS extends these contributions by insisting that any serious account of fairness in information access must treat bias, stakeholders, access technologies, barriers, metrics, and context as jointly constitutive, not optional add-ons (<xref ref-type="bibr" rid="R39">Friedman &#x0026; Nissenbaum, 1996</xref>; <xref ref-type="bibr" rid="R84">Nissenbaum, 2001</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>).</p>
<p>Second, FAIRS makes explicit that accountability, transparency, safety, privacy, and ethics are analytically distinct but interdependent fairness sub concepts that define what responsible information access requires (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R76">Makri et al., 2021</xref>; <xref ref-type="bibr" rid="R94">Rekabsaz et al., 2021</xref>). This aligns with recent work that maps fairness, accountability, transparency, and ethics (FATE) in information retrieval as overlapping but under-specified notions in need of clearer taxonomies and operational requirements (Bernard &#x0026; Balog, 2023; Visier, 2023). By embedding these sub concepts at the core of the framework, FAIRS links fairness metrics and audits to concrete governance demands, such as traceability of decisions, meaningful contestation, harm mitigation, and ethical orientation, rather than treating them as external constraints (<xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R41">Gao &#x0026; Shah, 2021</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>).</p>
<p>Third, FAIRS foregrounds the user not as a passive recipient of rankings and recommendations, but as a central stakeholder whose informational autonomy, exposure, and opportunities are directly shaped by algorithmic decisions across search, recommendation, and filtering systems (<xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>; <xref ref-type="bibr" rid="R45">Geyik &#x0026; Kenthapadi, 2018</xref>; Kramer et al., 2021). This perspective resonates with work on filter bubbles, confirmation bias, and the homogenisation of recommendations, which documents how iterative feedback loops can entrench exposure patterns and worldviews (<xref ref-type="bibr" rid="R3">Alstyne &#x0026; Brynjolfsson, 2005</xref>; Pariser, 2011; <xref ref-type="bibr" rid="R110">Tufekci, 2015</xref>). FAIRS situates these phenomena within a broader picture of distributive and representational harms, thus connecting experiential user harms to structural issues such as digital divides, accessibility failures, and network or net neutrality constraints (<xref ref-type="bibr" rid="R44">Gebremichael &#x0026; Jackson, 2006</xref>; <xref ref-type="bibr" rid="R53">Hamwela et al., 2018</xref>; <xref ref-type="bibr" rid="R113">Venkatasubramanian et al., 2021</xref>; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>).</p>
<p>These elements motivate a more formal, comprehensive definition of algorithmic fairness tailored to information access:</p>
<disp-quote>
<p><italic>&#x2018;Algorithmic fairness in the information access domain may be defined as the contextsensitive and multi-stakeholder responsibility of sociotechnical systems that search, rank, recommend, filter, or present information to ensure equitable access, exposure, and opportunity, while minimising allocative and representational harms and upholding accountability, transparency, safety, privacy, ethics, accessibility, and appropriate governance across data, models, interfaces, and implementation contexts.&#x2019; ---2</italic></p>
</disp-quote>
<p>This definition builds on and extends existing accounts that emphasise fair opportunities for exposure and quality for both consumers and providers in information access systems (<xref ref-type="bibr" rid="R13">Burke, 2017</xref>; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>).</p>
</sec>
<sec id="sec3_2">
<title>Core tensions and trade-offs in FAIRS</title>
<p>While FAIRS provides a more holistic lens, it also foregrounds tensions that are not easily resolved within existing technical or policy toolkits and reveal why a responsibility-based conception of fairness is normatively attractive but practically demanding (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; <xref ref-type="bibr" rid="R11">Blodgett et al., 2020</xref>; Sambasivan et al., 2021).</p>
</sec>
<sec id="sec3_3">
<title>Fair for whom versus fair how</title>
<p>The multi-stakeholder nature of information access systems means that &#x2018;Fair for whom?&#x2019; and &#x2018;Fair how?&#x2019; cannot be answered independently (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R105">Sonboli et al., 2022</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>). Provider-side fairness, consumer-side fairness, and platform-side objectives (e.g., engagement, revenue, regulatory compliance) often come into conflict (<xref ref-type="bibr" rid="R13">Burke, 2017</xref>; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>). For instance, equalising exposure for underrepresented artists or news outlets may reduce short-term click&#x2013;based relevance for some users, while optimising for maximum utility may exacerbate existing inequalities in visibility and opportunity (<xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>; <xref ref-type="bibr" rid="R42">Gao et al., 2022</xref>; <xref ref-type="bibr" rid="R117">Wu et al., 2022</xref>).</p>
<p>FAIRS do not resolve these conflicts; instead, it requires that stakeholders explicitly surface and govern them (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>). The framework positions fairness metrics (e.g., equal expected exposure, pairwise fairness, demographic parity, calibration) as tools for articulating trade-offs rather than as stand-alone solutions (<xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>; <xref ref-type="bibr" rid="R49">Giner, 2023</xref>; <xref ref-type="bibr" rid="R61">K&#x0131;rnap et al., 2021</xref>). This stance directly acknowledges impossibility results showing that different fairness criteria cannot simultaneously be satisfied under realistic conditions and that value-laden choices among these criteria are unavoidable (<xref ref-type="bibr" rid="R38">Friedler et al., 2021</xref>; <xref ref-type="bibr" rid="R114">Wachter &#x0026; Mittelstadt, 2019</xref>). In doing so, FAIRS invites designers and regulators to treat these conflicts as sites of negotiation shaped by legal, cultural, and ethical commitments, not purely technical optimisation problems (<xref ref-type="bibr" rid="R74">MacCarthy, 2019</xref>; <xref ref-type="bibr" rid="R106">Sonnenberg, 2020</xref>).</p>
</sec>
<sec id="sec3_4">
<title>Fairness versus relevance and utility</title>
<p>Another central tension lies between fairness constraints and traditional information retrieval goals of relevance and utility (<xref ref-type="bibr" rid="R51">Guiver &#x0026; Snelson, 2008</xref>; <xref ref-type="bibr" rid="R72">Lewandowski &#x0026; Spree, 2011</xref>; <xref ref-type="bibr" rid="R73">Li et al., 2014</xref>; <xref ref-type="bibr" rid="R79">Menczer et al., 2004</xref>). Fair ranking approaches that constrain exposure or prioritise diversity can degrade conventional effectiveness metrics, while ranking systems optimised solely for relevance risk reinforcing dominant perspectives and undeserving marginalised users or content (<xref ref-type="bibr" rid="R15">Celis &#x0026; Keswani, 2020</xref>; <xref ref-type="bibr" rid="R17">Chavula &#x0026; Suleman, 2016</xref>; <xref ref-type="bibr" rid="R59">Kay et al., 2015</xref>). Studies of search engines and scientific information show that highly ranked results often privilege specific framings or communities, with lower-ranked results offering systematically different perspectives that remain effectively invisible to most users (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R73">Li et al., 2014</xref>).</p>
<p>Within FAIRS, this tension is reframed as a normative design choice: whose utility, over what time horizon, and under which constraints count as relevant (<xref ref-type="bibr" rid="R7">Bauer &#x0026; Schiele, 2024</xref>; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>). Distributionally informed evaluation and stochastic ranking approaches already move in this direction by considering exposure distributions and worst-case group performance, but they still leave open fundamental questions about how to integrate long-term social welfare, epistemic diversity, and harm reduction into &#x201C;relevance&#x201D; (<xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R32">Ekstrand et al., 2024</xref>; <xref ref-type="bibr" rid="R43">Gao &#x0026; Shah, 2020</xref>). FAIRS thus highlights the need to reconceive relevance itself as a fairness&#x2013;aware construct, especially in high-stakes domains such as health, employment, and civic information, where unfair access can have material consequences (<xref ref-type="bibr" rid="R57">Joachims, 2021</xref>; <xref ref-type="bibr" rid="R78">McKearney et al., 2018</xref>).</p>
</sec>
<sec id="sec3_5">
<title>Fairness versus privacy and data minimisation</title>
<p>FAIRS also illuminates a persistent friction between fairness interventions and privacy protections (<xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>; <xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>; <xref ref-type="bibr" rid="R107">Spinelli &#x0026; Crovella, 2020</xref>). Group fairness metrics often require knowledge of protected attributes, yet many legal and ethical regimes encourage or mandate minimisation, obfuscation, or non-collection of such data (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>). Proxy-based or quantification-based approaches attempt to approximate group composition without direct identifiers, but they introduce their own risks of misclassification, opacity, and potential reidentification (<xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>; <xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>).</p>
<p>By treating privacy as both a constraint on and a dimension of fairness, FAIRS underscores that fairness interventions can themselves produce unfair burdens when they require invasive or asymmetric data collection from specific groups (Research Agenda for Algorithmic Fairness, 2022; <xref ref-type="bibr" rid="R114">Wachter &#x0026; Mittelstadt, 2019</xref>). At the same time, privacy-preserving practices that indiscriminately suppress sensitive information may obscure systematic harms and impede targeted remediation (<xref ref-type="bibr" rid="R11">Blodgett et al., 2020</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>). This creates a genuine governance dilemma: How to design accountability and audit mechanisms that can detect and address unfairness without deepening surveillance or eroding informational autonomy for already vulnerable communities (<xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R110">Tufekci, 2015</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R111">2024</xref>).</p>
</sec>
<sec id="sec3_6">
<title>Local context versus global portability</title>
<p>A further tension arises from the non-portability of fairness notions across cultural, legal, and infrastructural contexts. Much of the fairness discourse is grounded in Western, Euro-American understandings of discrimination, legal protections, and institutional capacities, which do not straightforwardly apply to contexts with different histories, regulatory environments, or social norms (<xref ref-type="bibr" rid="R44">Gebremichael &#x0026; Jackson, 2006</xref>; Sambasivan et al., 2021). Work on the non-portability of algorithmic fairness in India, as well as cross&#x2013;national comparisons of accessibility laws and net neutrality regimes, illustrates how seemingly neutral technical criteria can fail or even backfire when transplanted across domains (<xref ref-type="bibr" rid="R18">Conn, 2010</xref>; Sambasivan et al., 2021; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>).</p>
<p>FAIRS directly incorporates implementation context as a constitutive element, raising an open question: How far can a single framework travel before it becomes an instrument of epistemic or regulatory colonialism (<xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>)? The emphasis on contextsensitivity, sociotechnical analysis, and multi-stakeholder governance is intended to mitigate this risk, yet it also implies that instantiations of FAIRS will, and must, diverge across settings (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>). This variability complicates efforts to standardise fairness metrics or benchmarks globally and demands further work on reconciling local adaptation with crosscontext comparability and accountability (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>).</p>
</sec>
<sec id="sec3_7">
<title>Limitations of the FAIRS framework</title>
<p>The FAIRS framework, while more comprehensive than prevailing models, has several limitations that must be acknowledged.</p>
<p>First, FAIRS is primarily conceptual and synthesising: It identifies the necessary components and relations for thinking about fairness in information access, but does not specify operational metrics, algorithms, or governance procedures (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>). It offers guiding questions rather than prescriptive answers, and its efficacy depends on how practitioners, policymakers, and communities translate its categories into concrete practices and constraints (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R74">MacCarthy, 2019</xref>). This leaves a gap between high-level responsibility claims and the everyday realities of engineering and product decisions, where competing incentives and resource constraints are acute (<xref ref-type="bibr" rid="R41">Gao &#x0026; Shah, 2021</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>).</p>
<p>Second, the framework centres algorithmic fairness in the information access domain, which may limit its immediate applicability to adjacent but distinct contexts such as credit scoring, criminal justice, or hiring platforms that are less obviously &#x2019;information access&#x2019; systems yet still rely heavily on ranking and classification (<xref ref-type="bibr" rid="R6">Barocas &#x0026; Selbst, 2016</xref>; <xref ref-type="bibr" rid="R114">Wachter &#x0026; Mittelstadt, 2019</xref>). While many FAIRS components (e.g., bias, stakeholders, metrics, context) generalise, the specific emphasis on exposure, visibility, and access as primary goods may underemphasise other forms of harm or benefit in those domains (<xref ref-type="bibr" rid="R91">Pasquale, 2015</xref>; <xref ref-type="bibr" rid="R121">Zarsky, 2016</xref>).</p>
<p>Third, FAIRS is grounded in a particular scholarly canon and methodological approach, a PRISMA-based review of largely peer-reviewed, English-language literature from 2015 to 2025, plus additional triangulated sources (<xref ref-type="bibr" rid="R88">Page et al., 2021</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>). This corpus inevitably reflects selection biases, including the relative underrepresentation of non-English scholarship, practitioner know-how, and community-based or activist perspectives on algorithmic harms (<xref ref-type="bibr" rid="R21">Crawford, 2016</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>). As such, FAIRS risks systematically underweighting certain experiences of unfairness (e.g., those documented primarily in grey literature or local advocacy) and overweighting concerns prominent in well-resourced academic and industrial research communities (<xref ref-type="bibr" rid="R63">Kontiainen et al., 2022</xref>; Sambasivan et al., 2021).</p>
<p>Finally, the framework presupposes the feasibility and desirability of embedding fairness considerations at the design stage and throughout the system life cycle (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>). In practice, information access systems are often legacy, opaque, and tightly coupled with business models or infrastructural dependencies that resist substantial redesign (<xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R57">Joachims, 2021</xref>). Retrofitting FAIRS into such environments may require political and economic changes that extend well beyond the control of technical teams or even individual organisations (<xref ref-type="bibr" rid="R31">Ekstrand et al., 2022</xref>; <xref ref-type="bibr" rid="R74">MacCarthy, 2019</xref>). This limitation underscores that FAIRS is as much a normative agenda for governance and institutional reform as it is a conceptual framework for system design (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>).</p>
</sec>
<sec id="sec3_8">
<title>Open questions and future directions</title>
<p>The FAIRS framework raises a set of open questions that define a research and practice agenda for algorithmic fairness in information access.</p>
<list list-type="order">
<list-item><p>Operationalising multi-dimensional fairness. How can accountability, transparency, safety, privacy, and ethics be jointly operationalised in ways that are measurable yet sensitive to context (Bernard &#x0026; Balog, 2023; <xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>)? Existing taxonomies and audits typically focus on one or two dimensions at a time; FAIRS calls for integrated evaluation pipelines that can surface cross-dimensional trade-offs and conflicts (<xref ref-type="bibr" rid="R76">Makri et al., 2021</xref>; <xref ref-type="bibr" rid="R63">Research Agenda for Algorithmic Fairness, 2022</xref>).</p></list-item>
<list-item><p>Fairness-aware relevance modelling. What would it mean to build relevance models that incorporate fairness, diversity, and harm minimisation as first-class objectives, rather than post hoc constraints on ranking outputs (<xref ref-type="bibr" rid="R26">Diaz et al., 2020</xref>; <xref ref-type="bibr" rid="R32">Ekstrand et al., 2024</xref>)? This requires new theoretical formulations of utility and loss functions that reflect both user satisfaction and social equity, as well as new benchmarks that weight performance for historically marginalised groups more heavily than aggregate metrics (<xref ref-type="bibr" rid="R17">Chavula &#x0026; Hussein, 2016</xref>; <xref ref-type="bibr" rid="R59">Kay et al., 2015</xref>; <xref ref-type="bibr" rid="R117">Wu et al., 2022</xref>).</p></list-item>
<list-item><p>Context-sensitive portability and governance. How can frameworks like FAIRS be adapted to local contexts without losing their critical edge, and how can cross-context accountability be maintained when fairness standards legitimately diverge (Sambasivan et al., 2021; <xref ref-type="bibr" rid="R118">Yang &#x0026; Chen, 2015</xref>)? This question points to the need for participatory, multi-stakeholder governance structures capable of articulating and revising context-specific fairness norms over time (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>).</p></list-item>
<list-item><p>Privacy-preserving fairness audits. What technical and institutional arrangements can support robust fairness auditing under strong privacy and data minimisation constraints (<xref ref-type="bibr" rid="R19">Cornacchia et al., 2023</xref>; <xref ref-type="bibr" rid="R35">Fabris et al., 2023</xref>)? Promising directions include privacy&#x2013;preserving statistics, federated audits, and the use of synthetic or counterfactual data, but these approaches raise their own questions about validity, interpretability, and governance (<xref ref-type="bibr" rid="R11">Blodgett et al., 2020</xref>; <xref ref-type="bibr" rid="R74">MacCarthy, 2019</xref>).</p></list-item>
<list-item><p>Lifecycle integration and institutional change. Finally, how can the responsibility-based view of fairness be integrated into organisational and regulatory processes across the system lifecycle, from data collection and model design to deployment, monitoring, and decommissioning (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; <xref ref-type="bibr" rid="R104">Shah &#x0026; Bender, 2024</xref>)? FAIRS implies that fairness cannot be relegated to a single team or phase; instead, it must be woven into incentives, accountability structures, and professional norms, echoing calls from ethical computing codes and sociotechnical analyses of AI governance (<xref ref-type="bibr" rid="R23">Danaher, 2016</xref>; <xref ref-type="bibr" rid="R86">Noble, 2018</xref>; <xref ref-type="bibr" rid="R110">Tufekci, 2015</xref>).</p></list-item>
</list>
<p>In sum, FAIRS advances the field by offering a domain-specific, responsibility-oriented definition and framework for algorithmic fairness in information access, while openly acknowledging that any serious pursuit of fairness must grapple with deep trade-offs, context dependencies, and structural constraints (<xref ref-type="bibr" rid="R30">Ekstrand et al., 2019</xref>; Sambasivan et al., 2021; <xref ref-type="bibr" rid="R111">Udoh et al., 2022</xref>, <xref ref-type="bibr" rid="R112">2024</xref>). The framework is intended to provide shared language and structure for more rigorous, context&#x2013;aware, and ethically grounded conversations among researchers, practitioners, regulators, and affected communities about what fairness in information access should mean and how it might be pursued in practice (<xref ref-type="bibr" rid="R20">Costa et al., 2020</xref>; <xref ref-type="bibr" rid="R63">Research Agenda for Algorithmic Fairness, 2022</xref>; <xref ref-type="bibr" rid="R115">Webb et al., 2018</xref>).</p>
<p>FAIRS answers the concern raised by <xref ref-type="bibr" rid="R102">Selbst et al. (2019)</xref> of the lack of a universally accepted and contextually sensitive definition of algorithmic fairness by giving a context-sensitive definition of algorithmic fairness for information access and by specifying the substantive elements that must be considered together: Bias, users, technologies, barriers, metrics, and implementation context. Unlike <xref ref-type="bibr" rid="R13">Burke (2017)</xref>, which focuses on multisided fairness in recommender systems and especially provider- and consumer-side fairness, FAIRS expands the unit of analysis to the broader information access domain, including search, retrieval, ranking, recommender systems, accessibility, and governance. Most importantly, FAIRS defines fairness not only as exposure or allocation across stakeholders but as an interrelated responsibility structure spanning accountability, transparency, safety, privacy, and ethics across data, models, interfaces, and governance.</p>
</sec>
</sec>
<sec id="sec4">
<title>Conclusion</title>
<p>Algorithmic fairness in information access is best understood as a context-sensitive responsibility of information systems, rather than as a single metric or purely technical property. Existing work tends to fragment fairness across classification, ranking, and stakeholder perspectives, and demonstrates that this fragmentation obscures how bias, users, technologies, barriers, metrics, and implementation contexts interact to shape inequitable exposure and opportunity online.</p>
<p>In response, we introduce the FAIRS framework, which systematically integrates these elements into a single conceptual model designed specifically for information access systems. FAIRS reconceptualises fairness as a multidimensional responsibility structure&#x2014;spanning accountability, transparency, safety, privacy, and ethics, that must be embedded from the earliest stages of system design through deployment, evaluation, and governance, rather than treated as an after-the-fact constraint. By making explicit the trade-offs among competing fairness notions and metrics and by centring multi-stakeholder and socio&#x2013;technical contexts, the framework provides a theoretically grounded foundation for defining, assessing, and operationalising fairness in search, retrieval, ranking, and recommender systems.</p>
<p>Debates about &#x2018;Fair for whom?&#x2019; and &#x2018;Fair how?&#x2019; cannot be resolved within narrow, metric-only discussions but require attention to structural barriers, historical discrimination, and the specific domains in which information systems are implemented. FAIRS therefore positions algorithmic fairness in information access as an ongoing governance project: One that demands transparent metrics, careful attention to protected and proxy attributes, and sensitivity to context to avoid unjust, systematic disadvantages for individuals and groups. In doing so, the framework establishes a basis for future domain-specific fairness models and for more holistic, ethically robust approaches to designing and regulating information access technologies.</p>
<sec id="sec4_1">
<title>Future work</title>
<p>Our Framework aims to establish the core constitutive concepts in the algorithmic fairness discourse, enriching and balancing the discourse and providing a better foundation for other research efforts, especially in the information access domain. With this foundational work, new fairness models applicable to and appropriate for the information access context become a viable research agenda. It also provides a reference point for AI, ML, and information technology practitioners, vendors, and researchers on the ethical implications and challenges of integrating AI and ML in information access spaces.</p>
</sec>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="R1"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Ai</surname><given-names>Q.</given-names></name><name><surname>Wang</surname><given-names>X.</given-names></name><name><surname>Bendersky</surname><given-names>M.</given-names></name></person-group><year>2023</year><month>July</month><article-title>Metric-agnostic ranking optimization.</article-title><source>Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>2669</fpage><lpage>2680</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3539618.3591935">https://doi.org/10.1145/3539618.3591935</ext-link></comment></element-citation></ref>
<ref id="R2"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Akter</surname><given-names>T.</given-names></name><name><surname>Ahmed</surname><given-names>T.</given-names></name><name><surname>Kapadia</surname><given-names>A.</given-names></name><name><surname>Swaminathan</surname><given-names>S. M.</given-names></name></person-group><year>2020</year><month>October</month><article-title>Privacy considerations of the visually impaired with camera based assistive technologies: Misrepresentation, impropriety, and fairness.</article-title><source>Proceedings of the 22nd International ACM SIGACCESS Conference on Computers and Accessibility</source><fpage>1</fpage><lpage>14</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/1O.1145/3373625.3417003">https://doi.org/1O.1145/3373625.3417003</ext-link></comment></element-citation></ref>
<ref id="R3"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Alstyne</surname><given-names>M. V.</given-names></name><name><surname>Brynjolfsson</surname><given-names>E.</given-names></name></person-group><year>2005</year><article-title>Global village or cyber-Balkans? Modeling and measuring the integration of electronic communities</article-title><source>Management Science</source><volume>51</volume><issue>6</issue><comment>(June 2005)</comment><fpage>851</fpage><lpage>868</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/mnsc.1050.0363">https://doi.org/10.1287/mnsc.1050.0363</ext-link></comment></element-citation></ref>
<ref id="R4"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Balagopalan</surname><given-names>A.</given-names></name><name><surname>Jacobs</surname><given-names>A. Z.</given-names></name><name><surname>Biega</surname><given-names>A. J.</given-names></name></person-group><year>2023</year><month>July</month><article-title>The role of relevance in fair ranking.</article-title><source>Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>2650</fpage><lpage>2660</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3539618.3591933">https://doi.org/10.1145/3539618.3591933</ext-link></comment></element-citation></ref>
<ref id="R5"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bains</surname><given-names>J.</given-names></name></person-group><year>2020</year><article-title>Search engines and algorithms are biased. Here&#x0027;s why that matters: Librarians can take steps to address inequality and bias that result from using data historically weighted in favor of white men</article-title><source>Information Outlook</source><volume>24</volume><issue>1</issue><comment><ext-link ext-link-type="uri" xlink:href="https://scholarworks.sjsu.edu/slaio2020/1/">https://scholarworks.sjsu.edu/slaio2020/1/</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20240709201850/https://scholarworks.sjsu.edu/slaio2020/1/">https://web.archive.org/web/20240709201850/https://scholarworks.sjsu.edu/slaio2020/1/</ext-link></comment></element-citation></ref>
<ref id="R6"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Barocas</surname><given-names>S.</given-names></name><name><surname>Selbst</surname><given-names>A. D.</given-names></name></person-group><year>2016</year><article-title>Big data&#x2019;s disparate impact</article-title><source>California Law Review</source><volume>104</volume><issue>3</issue><fpage>671</fpage><lpage>732</lpage><comment><ext-link ext-link-type="doi" xlink:href="http://dx.doi.org/10.15779/Z38BG31">http://dx.doi.org/10.15779/Z38BG31</ext-link></comment></element-citation></ref>
<ref id="R7"><element-citation publication-type="book"><person-group person-group-type="editor"><name><surname>Bauer</surname><given-names>M. W.</given-names></name><name><surname>Schiele</surname><given-names>B.</given-names></name></person-group><year>2024</year><source>AI and common sense: Ambitions and frictions</source><publisher-name>Taylor &amp; Francis</publisher-name></element-citation></ref>
<ref id="R8"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Beer</surname><given-names>D.</given-names></name></person-group><year>2009</year><article-title>Power through the algorithm? Participatory web cultures and the technological unconscious</article-title><source>New Media and Society</source><volume>11</volume><issue>6</issue><fpage>985</fpage><lpage>1002</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/1461444809336551">https://doi.org/10.1177/1461444809336551</ext-link></comment></element-citation></ref>
<ref id="R9"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Beer</surname><given-names>D.</given-names></name></person-group><year>2013</year><article-title>Algorithms: Shaping tastes and manipulating the Ccrculations of popular culture.</article-title><source>Popular culture and new media: The politics of circulation</source><fpage>63</fpage><lpage>100</lpage><publisher-name>Palgrave Macmillan</publisher-name><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1057/97811372700614">https://doi.org/10.1057/97811372700614</ext-link></comment></element-citation></ref>
<ref id="R10"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bernard</surname><given-names>N.</given-names></name><name><surname>Balog</surname><given-names>K.</given-names></name></person-group><year>2025</year><article-title>A systematic review of fairness, accountability, transparency, and ethics in information retrieval</article-title><source>ACM Computing Surveys</source><volume>57</volume><issue>6</issue><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3637211">https://doi.org/10.1145/3637211</ext-link></comment></element-citation></ref>
<ref id="R11"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Blodgett</surname><given-names>S. L.</given-names></name><name><surname>Barocas</surname><given-names>S.</given-names></name><name><surname>Daum&#x00E9;</surname><given-names>H.</given-names><suffix>III</suffix></name><name><surname>Wallach</surname><given-names>H.</given-names></name></person-group><year>2020</year><article-title>Language (technology) is power: A critical survey of "bias" in NLP</article-title><source>arXiv</source><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.48550/arXiv.2005.14050">https://doi.org/10.48550/arXiv.2005.14050</ext-link></comment></element-citation></ref>
<ref id="R12"><element-citation publication-type="journal"><person-group person-group-type="editor"><name><surname>Bolukbasi</surname><given-names>T.</given-names></name><name><surname>Chang</surname><given-names>K.-W.</given-names></name><name><surname>Zou</surname><given-names>J. Y.</given-names></name><name><surname>Saligrama</surname><given-names>V.</given-names></name><name><surname>Kalai</surname><given-names>A. T.</given-names></name></person-group><year>2016</year><article-title>Man is to computer programmer as woman is to homemaker? Debiasing word embeddings</article-title><person-group person-group-type="editor"><name><surname>Lee</surname><given-names>D. D.</given-names></name><name><surname>Sugiyama</surname><given-names>M.</given-names></name><name><surname>Luxburg</surname><given-names>U. V.</given-names></name><name><surname>Guyon</surname><given-names>I.</given-names></name><name><surname>Garnett</surname><given-names>R.</given-names></name></person-group><source>Advances in neural information processing systems</source><volume>29</volume><comment>Curran Associates, Inc</comment></element-citation></ref>
<ref id="R13"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Burke</surname><given-names>R.</given-names></name></person-group><year>2017</year><month>July</month><article-title>Multisided fairness for recommendation</article-title><source>arXiv</source><comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.48550/arXiv.1707.00093">https://doi.org/10.48550/arXiv.1707.00093</ext-link></comment></element-citation></ref>
<ref id="R14"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Cachel</surname><given-names>K.</given-names></name><name><surname>Rundensteiner</surname><given-names>E.</given-names></name></person-group><year>2024</year><month>October</month><article-title>Wise fusion: Group fairness enhanced rank fusion</article-title><source>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</source><fpage>163</fpage><lpage>174</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3627673.3679649">https://doi.org/10.1145/3627673.3679649</ext-link></comment></element-citation></ref>
<ref id="R15"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Celis</surname><given-names>L. E.</given-names></name><name><surname>Keswani</surname><given-names>V.</given-names></name></person-group><year>2020</year><article-title>Implicit diversity in image summarization</article-title><source>Proceedings of the ACM on Human-Computer Interaction</source><volume>4</volume><issue>CSCW2</issue><fpage>1</fpage><lpage>28</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3415210">https://doi.org/10.1145/3415210</ext-link></comment></element-citation></ref>
<ref id="R16"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Chaney</surname><given-names>A. J. B.</given-names></name><name><surname>Stewart</surname><given-names>B. M.</given-names></name><name><surname>Engelhardt</surname><given-names>B. E.</given-names></name></person-group><year>2018</year><article-title>How algorithmic confounding in recommendation systems increases homogeneity and decreases utility.</article-title><source>Proceedings of the 12th ACM Conference on Recommender Systems</source><fpage>224</fpage><lpage>232</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3240323.3240370">https://doi.org/10.1145/3240323.3240370</ext-link></comment></element-citation></ref>
<ref id="R17"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Chavula</surname><given-names>C.</given-names></name><name><surname>Suleman</surname><given-names>H.</given-names></name></person-group><year>2016</year><month>December</month><article-title>Assessing the impact of vocabulary similarity on multilingual information retrieval for Bantu languages.</article-title><source>Proceedings of the 8th Annual Meeting of the Forum for Information Retrieval Evaluation</source><fpage>16</fpage><lpage>23</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3015157.3015160">https://doi.org/10.1145/3015157.3015160</ext-link></comment></element-citation></ref>
<ref id="R18"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Conn</surname><given-names>J.</given-names></name></person-group><year>2010</year><article-title>Still stuck on neutrality. No legislative remedy likely over Internet fair play</article-title><source>Modern Healthcare</source><volume>40</volume><issue>41</issue><fpage>30</fpage><lpage>31</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://pubmed.ncbi.nlm.nih.gov/21033002/">https://pubmed.ncbi.nlm.nih.gov/21033002/</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260422193955/https://pubmed.ncbi.nlm.nih.gov/21033002/">https://web.archive.org/web/20260422193955/https://pubmed.ncbi.nlm.nih.gov/21033002/</ext-link></comment></element-citation></ref>
<ref id="R19"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cornacchia</surname><given-names>G.</given-names></name><name><surname>Anelli</surname><given-names>V. W.</given-names></name><name><surname>Biancofiore</surname><given-names>G. M.</given-names></name><name><surname>Narducci</surname><given-names>F.</given-names></name><name><surname>Pomo</surname><given-names>C.</given-names></name><name><surname>Ragone</surname><given-names>A.</given-names></name><name><surname>Di Sciascio</surname><given-names>E.</given-names></name></person-group><year>2023</year><article-title>Auditing fairness under unawareness through counterfactual reasoning</article-title><source>Information Processing &amp; Management</source><volume>60</volume><issue>2</issue><fpage>103224</fpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.ipm.2022.103224">https://doi.org/10.1016/j.ipm.2022.103224</ext-link></comment></element-citation></ref>
<ref id="R20"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Costa</surname><given-names>N.</given-names></name><name><surname>Nielsen</surname><given-names>M.</given-names></name><name><surname>Jull</surname><given-names>G.</given-names></name><name><surname>Claus</surname><given-names>A. P.</given-names></name><name><surname>Hodges</surname><given-names>P. W.</given-names></name></person-group><year>2020</year><article-title>Low back pain websites do not meet the needs of consumers: A study of online resources at three time points</article-title><source>Health Information Management Journal</source><volume>49</volume><issue>2-3</issue><fpage>137</fpage><lpage>149</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/1833358319857354">https://doi.org/10.1177/1833358319857354</ext-link></comment></element-citation></ref>
<ref id="R21"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Crawford</surname><given-names>K.</given-names></name></person-group><year>2016</year><article-title>Can an algorithm be agonistic? Ten scenes from life in calculated publics</article-title><source>Science, Technology &amp; Human Values</source><volume>41</volume><issue>1</issue><fpage>77</fpage><lpage>92</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/0162243915589635">https://doi.org/10.1177/0162243915589635</ext-link></comment></element-citation></ref>
<ref id="R22"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Crawford</surname><given-names>K.</given-names></name></person-group><year>2017</year><month>December</month><source>The trouble with bias</source><comment>Video</comment><publisher-name>YouTube</publisher-name><comment><ext-link ext-link-type="uri" xlink:href="https://youtu.be/fMymBKWQzk">https://youtu.be/fMymBKWQzk</ext-link> (Archived at <ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20251220102224/">https://web.archive.org/web/20251220102224/</ext-link><ext-link ext-link-type="uri" xlink:href="https://www.youtube.com/watch?v=fMymBKWQzk">https://www.youtube.com/watch?v=fMymBKWQzk</ext-link>)</comment></element-citation></ref>
<ref id="R23"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Danaher</surname><given-names>J.</given-names></name></person-group><year>2016</year><article-title>The threat of algocracy: Reality, resistance and accommodation</article-title><source>Philosophy &amp; Technology</source><volume>29</volume><issue>3</issue><fpage>245</fpage><lpage>268</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/s13347-015-0211-1">https://doi.org/10.1007/s13347-015-0211-1</ext-link></comment></element-citation></ref>
<ref id="R24"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Dash</surname><given-names>A.</given-names></name><name><surname>Chakraborty</surname><given-names>A.</given-names></name><name><surname>Ghosh</surname><given-names>S.</given-names></name><name><surname>Mukherjee</surname><given-names>A.</given-names></name><name><surname>Gummadi</surname><given-names>K. P.</given-names></name></person-group><year>2022</year><article-title>Alexa, in you, I trust! Fairness and interpretability issues in e-commerce search through smart speakers.</article-title><source>Proceedings of the ACM Web Conference 2022</source><fpage>3695</fpage><lpage>3705</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3485447.3512265">https://doi.org/10.1145/3485447.3512265</ext-link></comment></element-citation></ref>
<ref id="R25"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Dhaliwal</surname><given-names>M. P.</given-names></name><name><surname>Muskaan</surname></name><name><surname>Seth</surname><given-names>A.</given-names></name></person-group><year>2021</year><article-title>Fairness and diversity in the recommendation and ranking of participatory media content.</article-title><source>Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining</source><fpage>43</fpage><lpage>47</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3487351.3488363">https://doi.org/10.1145/3487351.3488363</ext-link></comment></element-citation></ref>
<ref id="R26"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Diaz</surname><given-names>F.</given-names></name><name><surname>Mitra</surname><given-names>B.</given-names></name><name><surname>Ekstrand</surname><given-names>M. D.</given-names></name><name><surname>Biega</surname><given-names>A. J.</given-names></name><name><surname>Carterette</surname><given-names>B.</given-names></name></person-group><year>2020</year><article-title>Evaluating stochastic rankings with expected exposure.</article-title><source>Proceedings of the 29th ACM International Conference on Information and Knowledge Management</source><fpage>275</fpage><lpage>284</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3340531.3411962">https://doi.org/10.1145/3340531.3411962</ext-link></comment></element-citation></ref>
<ref id="R27"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Diaz</surname><given-names>F.</given-names></name></person-group><year>2024</year><article-title>Pessimistic evaluation.</article-title><source>Proceedings of the 2024 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region</source><fpage>115</fpage><lpage>124</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3673791.3698428">https://doi.org/10.1145/3673791.3698428</ext-link></comment></element-citation></ref>
<ref id="R28"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Du</surname><given-names>Y.</given-names></name><name><surname>Shi</surname><given-names>Y.</given-names></name><name><surname>Zhao</surname><given-names>X.</given-names></name></person-group><year>2007</year><article-title>Using spam farm to boost PageRank.</article-title><source>Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web</source><fpage>29</fpage><lpage>36</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1244408.1244415">https://doi.org/10.1145/1244408.1244415</ext-link></comment></element-citation></ref>
<ref id="R29"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Dwork</surname><given-names>C.</given-names></name><name><surname>Hardt</surname><given-names>M.</given-names></name><name><surname>Pitassi</surname><given-names>T.</given-names></name><name><surname>Reingold</surname><given-names>O.</given-names></name><name><surname>Zemel</surname><given-names>R.</given-names></name></person-group><year>2012</year><article-title>Fairness through awareness.</article-title><source>Proceedings of the Innovations in Theoretical Computer Science Conference</source><fpage>214</fpage><lpage>226</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/2090236.2090255">https://doi.org/10.1145/2090236.2090255</ext-link></comment></element-citation></ref>
<ref id="R30"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Ekstrand</surname><given-names>M. D.</given-names></name><name><surname>Burke</surname><given-names>R.</given-names></name><name><surname>Diaz</surname><given-names>F.</given-names></name></person-group><year>2019</year><article-title>Fairness and discrimination in recommendation and retrieval.</article-title><source>Proceedings of the 13th ACM Conference on Recommender Systems</source><fpage>576</fpage><lpage>577</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3298689.3346964">https://doi.org/10.1145/3298689.3346964</ext-link></comment></element-citation></ref>
<ref id="R31"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ekstrand</surname><given-names>M. D.</given-names></name><name><surname>Das</surname><given-names>A.</given-names></name><name><surname>Burke</surname><given-names>R.</given-names></name><name><surname>Diaz</surname><given-names>F.</given-names></name></person-group><year>2022</year><article-title>Fairness in information access systems</article-title><source>Foundations and Trends in Information Retrieval</source><volume>16</volume><issue>1-2</issue><fpage>1</fpage><lpage>177</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.48550/arXiv.2105.05779">https://doi.org/10.48550/arXiv.2105.05779</ext-link></comment></element-citation></ref>
<ref id="R32"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ekstrand</surname><given-names>M. D.</given-names></name><name><surname>Carterette</surname><given-names>B.</given-names></name><name><surname>Diaz</surname><given-names>F.</given-names></name></person-group><year>2024</year><article-title>Distributionally-informed recommender system evaluation</article-title><source>ACM Transactions on Recommender Systems</source><volume>2</volume><issue>1</issue><fpage>1</fpage><lpage>27</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3613455">https://doi.org/10.1145/3613455</ext-link></comment></element-citation></ref>
<ref id="R33"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Epps-Darling</surname><given-names>A.</given-names></name><name><surname>Bouyer</surname><given-names>R. T.</given-names></name><name><surname>Cramer</surname><given-names>H.</given-names></name></person-group><year>2020</year><article-title>Artist gender representation in music streaming.</article-title><source>Proceedings of the 21st International Society for Music Information Retrieval Conference</source><fpage>248</fpage><lpage>254</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://archives.ismir.net/ismir2020/paper/000148.pdf">https://archives.ismir.net/ismir2020/paper/000148.pdf</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260210055209/http://archives.ismir.net/ismir2020/paper/000148.pdf">https://web.archive.org/web/20260210055209/http://archives.ismir.net/ismir2020/paper/000148.pdf</ext-link></comment></element-citation></ref>
<ref id="R34"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Eubanks</surname><given-names>V.</given-names></name></person-group><year>2018</year><month>January</month><article-title>The digital poorhouse</article-title><source>Harper&#x2019;s Magazine</source><comment><ext-link ext-link-type="uri" xlink:href="https://harpers.org/archive/2018/01/the-digital-poorhouse/">https://harpers.org/archive/2018/01/the-digital-poorhouse/</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260210075441/https://harpers.org/archive/2018/01/the-digital-poorhouse/">https://web.archive.org/web/20260210075441/https://harpers.org/archive/2018/01/the-digital-poorhouse/</ext-link></comment></element-citation></ref>
<ref id="R35"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Fabris</surname><given-names>A.</given-names></name><name><surname>Silvello</surname><given-names>G.</given-names></name><name><surname>Susto</surname><given-names>G. A.</given-names></name><name><surname>Biega</surname><given-names>A. J.</given-names></name></person-group><year>2023</year><article-title>Pairwise fairness in ranking as a dissatisfaction measure.</article-title><source>Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining</source><fpage>931</fpage><lpage>939</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3539597.3570459">https://doi.org/10.1145/3539597.3570459</ext-link></comment></element-citation></ref>
<ref id="R36"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Feldman</surname><given-names>M.</given-names></name><name><surname>Friedler</surname><given-names>S. A.</given-names></name><name><surname>Moeller</surname><given-names>J.</given-names></name><name><surname>Scheidegger</surname><given-names>C.</given-names></name><name><surname>Venkatasubramanian</surname><given-names>S.</given-names></name></person-group><year>2015</year><article-title>Certifying and removing disparate impact.</article-title><source>Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source><fpage>259</fpage><lpage>268</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/2783258.2783311">https://doi.org/10.1145/2783258.2783311</ext-link></comment></element-citation></ref>
<ref id="R37"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Ferguson</surname><given-names>A. G.</given-names></name></person-group><year>2017</year><source>The rise of big data policing: Surveillance, race, and the future of law enforcement</source><publisher-name>New York University Press</publisher-name></element-citation></ref>
<ref id="R38"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Friedler</surname><given-names>S.</given-names></name><name><surname>Scheidegger</surname><given-names>C.</given-names></name><name><surname>Venkatasubramanian</surname><given-names>S.</given-names></name></person-group><year>2021</year><article-title>The (im)possibility of fairness: Different value systems require different mechanisms for fair decision making</article-title><source>Communications of the ACM</source><volume>64</volume><issue>4</issue><fpage>136</fpage><lpage>143</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3433949">https://doi.org/10.1145/3433949</ext-link></comment></element-citation></ref>
<ref id="R39"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Friedman</surname><given-names>B.</given-names></name><name><surname>Nissenbaum</surname><given-names>H.</given-names></name></person-group><year>1996</year><article-title>Bias in computer systems</article-title><source>ACM Transactions on Information Systems</source><volume>14</volume><issue>3</issue><fpage>330</fpage><lpage>347</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/230538.230561">https://doi.org/10.1145/230538.230561</ext-link></comment></element-citation></ref>
<ref id="R40"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Fuller</surname><given-names>M.</given-names></name><name><surname>Goffey</surname><given-names>A.</given-names></name></person-group><year>2012</year><article-title>Algorithms.</article-title><source>Evil media</source><fpage>69</fpage><lpage>82</lpage><publisher-name>MIT Press</publisher-name></element-citation></ref>
<ref id="R41"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>R.</given-names></name><name><surname>Shah</surname><given-names>C.</given-names></name></person-group><year>2021</year><article-title>Addressing bias and fairness in search systems.</article-title><source>Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>2643</fpage><lpage>2646</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3404835.3462807">https://doi.org/10.1145/3404835.3462807</ext-link></comment></element-citation></ref>
<ref id="R42"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>R.</given-names></name><name><surname>Ge</surname><given-names>Y.</given-names></name><name><surname>Shah</surname><given-names>C.</given-names></name></person-group><year>2022</year><article-title>FAIR: Fairness-aware information retrieval evaluation</article-title><source>Journal of the Association for Information Science and Technology</source><volume>73</volume><issue>10</issue><fpage>1461</fpage><lpage>1473</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/asi.24648">https://doi.org/10.1002/asi.24648</ext-link></comment></element-citation></ref>
<ref id="R43"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>R.</given-names></name><name><surname>Shah</surname><given-names>C.</given-names></name></person-group><year>2020</year><article-title>Toward creating a fairer ranking in search engine results</article-title><source>Information Processing &amp; Management</source><volume>57</volume><issue>1</issue><fpage>102138</fpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.ipm.2019.102138">https://doi.org/10.1016/j.ipm.2019.102138</ext-link></comment></element-citation></ref>
<ref id="R44"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gebremichael</surname><given-names>M. D.</given-names></name><name><surname>Jackson</surname><given-names>J. W.</given-names></name></person-group><year>2006</year><article-title>Bridging the gap in Sub-Saharan Africa: A holistic look at information poverty and the region&#x0027;s digital divide</article-title><source>Government Information Quarterly</source><volume>23</volume><issue>2</issue><fpage>267</fpage><lpage>280</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.giq.2006.02.011">https://doi.org/10.1016/j.giq.2006.02.011</ext-link></comment></element-citation></ref>
<ref id="R45"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Geyik</surname><given-names>S. C.</given-names></name><name><surname>Kenthapadi</surname><given-names>K.</given-names></name></person-group><year>2018</year><month>October</month><article-title>Building representative talent search at LinkedIn</article-title><source>LinkedIn Engineering Blog</source><comment><ext-link ext-link-type="uri" xlink:href="https://engineering.linkedin.com/blog/2018/10/building-representative-talent-search-at-linkedin">https://engineering.linkedin.com/blog/2018/10/building-representative-talent-search-at-linkedin</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260123093645/https://www.linkedin.com/blog/engineering/hiring/building-representative-talent-search-at-linkedin">https://web.archive.org/web/20260123093645/https://www.linkedin.com/blog/engineering/hiring/building-representative-talent-search-at-linkedin</ext-link></comment></element-citation></ref>
<ref id="R46"><element-citation publication-type="book"><person-group person-group-type="editor"><name><surname>Gillespie</surname><given-names>T.</given-names></name></person-group><year>2014</year><article-title>The relevance of algorithms</article-title><person-group person-group-type="editor"><name><surname>Gillespie</surname><given-names>T.</given-names></name><name><surname>Boczkowski</surname><given-names>P. J.</given-names></name><name><surname>Foot</surname><given-names>K. A.</given-names></name></person-group><source>Media technologies: Essays on communication, materiality, and society</source><fpage>167</fpage><lpage>193</lpage><publisher-name>MIT Press</publisher-name></element-citation></ref>
<ref id="R47"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Gillespie</surname><given-names>T.</given-names></name></person-group><year>2016</year><month>February</month><article-title>#trendingistrending: When algorithms become culture</article-title><source>Culture Digitally</source><comment><ext-link ext-link-type="uri" xlink:href="http://culturedigitally.org/2016/02/trendingistrending/">http://culturedigitally.org/2016/02/trendingistrending/</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260218143639/https://culturedigitally.org/2016/02/trendingistrending/">https://web.archive.org/web/20260218143639/https://culturedigitally.org/2016/02/trendingistrending/</ext-link></comment></element-citation></ref>
<ref id="R48"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Gillespie</surname><given-names>T.</given-names></name></person-group><year>2019</year><article-title>Algorithmically recognizable: Santorum&#x2019;s Google problem, and Google&#x2019;s Santorum problem.</article-title><source>The social power of algorithms</source><fpage>63</fpage><lpage>80</lpage><publisher-name>Routledge</publisher-name></element-citation></ref>
<ref id="R49"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Giner</surname><given-names>F.</given-names></name></person-group><year>2023</year><article-title>Information retrieval evaluation measures defined on some axiomatic models of preferences</article-title><source>ACM Transactions on Information Systems</source><volume>42</volume><issue>3</issue><fpage>1</fpage><lpage>35</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3632171">https://doi.org/10.1145/3632171</ext-link></comment></element-citation></ref>
<ref id="R50"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Gotterbarn</surname><given-names>D. W.</given-names></name><name><surname>Brinkman</surname><given-names>B.</given-names></name><name><surname>Flick</surname><given-names>C.</given-names></name><name><surname>Kirkpatrick</surname><given-names>M. S.</given-names></name><name><surname>Miller</surname><given-names>K.</given-names></name><name><surname>Vazansky</surname><given-names>K.</given-names></name><name><surname>Wolf</surname><given-names>M. J.</given-names></name></person-group><year>2018</year><source>ACM code of ethics and professional conduct</source><comment><ext-link ext-link-type="uri" xlink:href="https://dora.dmu.ac.uk/server/api/core/bitstreams/1e5b3cb8-2d77-4ab4-885b-d5996b74605f/content">https://dora.dmu.ac.uk/server/api/core/bitstreams/1e5b3cb8-2d77-4ab4-885b-d5996b74605f/content</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20250501011834/https://dora.dmu.ac.uk/server/api/core/bitstreams/1e5b3cb8-2d77-4ab4-885b-d5996b74605f/content">https://web.archive.org/web/20250501011834/https://dora.dmu.ac.uk/server/api/core/bitstreams/1e5b3cb8-2d77-4ab4-885b-d5996b74605f/content</ext-link></comment></element-citation></ref>
<ref id="R51"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Guiver</surname><given-names>J.</given-names></name><name><surname>Snelson</surname><given-names>E.</given-names></name></person-group><year>2008</year><article-title>Learning to rank with Softrank and Gaussian processes.</article-title><source>Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>259</fpage><lpage>266</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1390334.1390380">https://doi.org/10.1145/1390334.1390380</ext-link></comment></element-citation></ref>
<ref id="R52"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Guo</surname><given-names>S.</given-names></name><name><surname>Zhang</surname><given-names>S.</given-names></name><name><surname>Sun</surname><given-names>W.</given-names></name><name><surname>Ren</surname><given-names>P.</given-names></name><name><surname>Chen</surname><given-names>Z.</given-names></name><name><surname>Ren</surname><given-names>Z.</given-names></name></person-group><year>2023</year><article-title>Towards explainable conversational recommender systems.</article-title><source>Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>2786</fpage><lpage>2795</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3539618.3591884">https://doi.org/10.1145/3539618.3591884</ext-link></comment></element-citation></ref>
<ref id="R53"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hamwela</surname><given-names>V.</given-names></name><name><surname>Ahmed</surname><given-names>W.</given-names></name><name><surname>Bath</surname><given-names>P. A.</given-names></name></person-group><year>2018</year><article-title>Evaluation of websites that contain information relating to malaria in pregnancy</article-title><source>Public Health</source><volume>157</volume><fpage>50</fpage><lpage>52</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.puhe.2018.01.001">https://doi.org/10.1016/j.puhe.2018.01.001</ext-link></comment></element-citation></ref>
<ref id="R54"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hargittai</surname><given-names>E.</given-names></name></person-group><year>2007</year><article-title>The social, political, economic, and cultural dimensions of search engines: An introduction</article-title><source>Journal of Computer-Mediated Communication</source><volume>12</volume><issue>3</issue><fpage>769</fpage><lpage>777</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1111/j.1083-6101.2007.00349.x">https://doi.org/10.1111/j.1083-6101.2007.00349.x</ext-link></comment></element-citation></ref>
<ref id="R55"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Introna</surname><given-names>L. D.</given-names></name><name><surname>Nissenbaum</surname><given-names>H.</given-names></name></person-group><year>2000</year><article-title>Shaping the web: Why the politics of search engines matters</article-title><source>The Information Society</source><volume>16</volume><issue>3</issue><fpage>169</fpage><lpage>185</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1080/01972240050133634">https://doi.org/10.1080/01972240050133634</ext-link></comment></element-citation></ref>
<ref id="R56"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jeong</surname><given-names>W.</given-names></name></person-group><year>2006</year><article-title>Force feedback textual and graphic displays for the blind</article-title><source>Proceedings of the American Society for Information Science and Technology</source><volume>43</volume><issue>1</issue><fpage>1</fpage><lpage>11</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/meet.14504301156">https://doi.org/10.1002/meet.14504301156</ext-link></comment></element-citation></ref>
<ref id="R57"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Joachims</surname><given-names>T.</given-names></name></person-group><year>2021</year><article-title>Fairness and control of exposure in two-sided markets.</article-title><source>Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval</source><fpage>1</fpage><lpage>1</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3471158.3472226">https://doi.org/10.1145/3471158.3472226</ext-link></comment></element-citation></ref>
<ref id="R58"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Joachims</surname><given-names>T.</given-names></name><name><surname>Granka</surname><given-names>L.</given-names></name><name><surname>Pan</surname><given-names>B.</given-names></name><name><surname>Hembrooke</surname><given-names>H.</given-names></name><name><surname>Gay</surname><given-names>G.</given-names></name></person-group><year>2017</year><article-title>Accurately interpreting clickthrough data as implicit feedback</article-title><source>SIGIR Forum</source><volume>51</volume><issue>1</issue><fpage>4</fpage><lpage>11</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3130332.313033">https://doi.org/10.1145/3130332.313033</ext-link></comment></element-citation></ref>
<ref id="R59"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Kay</surname><given-names>M.</given-names></name><name><surname>Matuszek</surname><given-names>C.</given-names></name><name><surname>Munson</surname><given-names>S. A.</given-names></name></person-group><year>2015</year><article-title>Unequal representation and gender stereotypes in image search results for occupations.</article-title><source>Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems</source><fpage>3819</fpage><lpage>3828</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/2702123.270252">https://doi.org/10.1145/2702123.270252</ext-link></comment></element-citation></ref>
<ref id="R60"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Kearns</surname><given-names>M.</given-names></name><name><surname>Roth</surname><given-names>A.</given-names></name></person-group><year>2020</year><source>The ethical algorithm: The science of socially aware algorithm design</source><publisher-name>Oxford University Press</publisher-name></element-citation></ref>
<ref id="R61"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>K&#x0131;rnap</surname><given-names>&#x00D6;</given-names></name><name><surname>Diaz</surname><given-names>F.</given-names></name><name><surname>Biega</surname><given-names>A.</given-names></name><name><surname>Ekstrand</surname><given-names>M.</given-names></name><name><surname>Carterette</surname><given-names>B.</given-names></name><name><surname>&amp; Yilmaz</surname><given-names>E.</given-names></name></person-group><year>2021</year><article-title>Estimation of fair ranking metrics with incomplete judgments.</article-title><source>Proceedings of the Web Conference 2021</source><fpage>1065</fpage><lpage>1075</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3442381.345008">https://doi.org/10.1145/3442381.345008</ext-link></comment></element-citation></ref>
<ref id="R62"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kleinberg</surname><given-names>J.</given-names></name></person-group><year>1999</year><article-title>Authoritative sources in a hyperlinked environment</article-title><source>Journal of the ACM</source><volume>46</volume><issue>5</issue><fpage>604</fpage><lpage>632</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/324133.324140">https://doi.org/10.1145/324133.324140</ext-link></comment></element-citation></ref>
<ref id="R63"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kontiainen</surname><given-names>L.</given-names></name><name><surname>Koulu</surname><given-names>R.</given-names></name><name><surname>Sankari</surname><given-names>S.</given-names></name></person-group><year>2022</year><article-title>Research agenda for algorithmic fairness studies: Access to justice lessons for interdisciplinary research</article-title><source>Frontiers in Artificial Intelligence</source><volume>5</volume><fpage>882134</fpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3389/frai.2022.882134">https://doi.org/10.3389/frai.2022.882134</ext-link></comment></element-citation></ref>
<ref id="R64"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Koskela</surname><given-names>M.</given-names></name><name><surname>Luukkonen</surname><given-names>P.</given-names></name><name><surname>Ruotsalo</surname><given-names>T.</given-names></name><name><surname>Sj&#x00F6;berg</surname><given-names>M.</given-names></name><name><surname>Flor&#x00E9;en</surname><given-names>P.</given-names></name></person-group><year>2018</year><article-title>Proactive information retrieval by capturing search intent from primary task context</article-title><source>ACM Transactions on Interactive Intelligent Systems</source><volume>8</volume><issue>3</issue><fpage>1</fpage><lpage>25</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3150975">https://doi.org/10.1145/3150975</ext-link></comment></element-citation></ref>
<ref id="R65"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kr&#x00E4;mer</surname><given-names>T.</given-names></name><name><surname>Papenmeier</surname><given-names>A.</given-names></name><name><surname>Carevic</surname><given-names>Z.</given-names></name><name><surname>Kern</surname><given-names>D.</given-names></name><name><surname>Mathiak</surname><given-names>B.</given-names></name></person-group><year>2021</year><article-title>Data-seeking behaviour in the social sciences</article-title><source>International Journal on Digital Libraries</source><volume>22</volume><fpage>175</fpage><lpage>195</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/s00799-021-00303-0">https://doi.org/10.1007/s00799-021-00303-0</ext-link></comment></element-citation></ref>
<ref id="R66"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Krestel</surname><given-names>R.</given-names></name><name><surname>Fankhauser</surname><given-names>P.</given-names></name><name><surname>Nejdl</surname><given-names>W.</given-names></name></person-group><year>2009</year><article-title>Latent Dirichlet allocation for tag recommendation.</article-title><source>Proceedings of the Third ACM Conference on Recommender Systems</source><fpage>61</fpage><lpage>68</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1639714.1639726">https://doi.org/10.1145/1639714.1639726</ext-link></comment></element-citation></ref>
<ref id="R67"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kroll</surname><given-names>J. A.</given-names></name><name><surname>Huey</surname><given-names>J.</given-names></name><name><surname>Barocas</surname><given-names>S.</given-names></name><name><surname>Felten</surname><given-names>E. W.</given-names></name><name><surname>Reidenberg</surname><given-names>J. R.</given-names></name><name><surname>Robinson</surname><given-names>D. G.</given-names></name><name><surname>Yu</surname><given-names>H.</given-names></name></person-group><year>2017</year><article-title>Accountable algorithms</article-title><source>University of Pennsylvania Law Review</source><volume>165</volume><fpage>633</fpage><lpage>705</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://repository.law.upenn.edu/Documents/Detail/accountable-algorithms/155735">https://repository.law.upenn.edu/Documents/Detail/accountable-algorithms/155735</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260218210455/https://repository.law.upenn.edu/Documents/Detail/accountable-algorithms/155735">https://web.archive.org/web/20260218210455/https://repository.law.upenn.edu/Documents/Detail/accountable-algorithms/155735</ext-link></comment></element-citation></ref>
<ref id="R68"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname><given-names>R.</given-names></name><name><surname>Raghavan</surname><given-names>P.</given-names></name><name><surname>Rajagopalan</surname><given-names>S.</given-names></name><name><surname>Tomkins</surname><given-names>A.</given-names></name></person-group><year>2006</year><article-title>Core algorithms in the CLEVER system</article-title><source>ACM Transactions on Internet Technology</source><volume>6</volume><issue>2</issue><fpage>131</fpage><lpage>152</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1149121.1149123">https://doi.org/10.1145/1149121.1149123</ext-link></comment></element-citation></ref>
<ref id="R69"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Lamprier</surname><given-names>S.</given-names></name><name><surname>Amghar</surname><given-names>T.</given-names></name><name><surname>Saubion</surname><given-names>F.</given-names></name><name><surname>Levrat</surname><given-names>B.</given-names></name></person-group><year>2010</year><article-title>Traveling among clusters: A way to reconsider the benefits of the cluster hypothesis.</article-title><source>Proceedings of the 2010 ACM Symposium on Applied Computing</source><fpage>1774</fpage><lpage>1780</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1774088.1774465">https://doi.org/10.1145/1774088.1774465</ext-link></comment></element-citation></ref>
<ref id="R70"><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Latzer</surname><given-names>M.</given-names></name><name><surname>Hollnbuchner</surname><given-names>K.</given-names></name><name><surname>Just</surname><given-names>N.</given-names></name><name><surname>Saurwein</surname><given-names>F.</given-names></name></person-group><year>2014</year><source>The economics of algorithmic selection on the internet</source><comment>(Working Paper &#x2013; Media Change &amp; Innovation Division)</comment><publisher-name>University of Zurich</publisher-name><comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4337/9780857939852.00028">https://doi.org/10.4337/9780857939852.00028</ext-link></comment></element-citation></ref>
<ref id="R71"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lederman</surname><given-names>N. G.</given-names></name><name><surname>Lederman</surname><given-names>J. S.</given-names></name></person-group><year>2015</year><article-title>What is a theoretical framework? A practical answer</article-title><source>Journal of Science Teacher Education</source><volume>26</volume><issue>7</issue><fpage>593</fpage><lpage>597</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/s10972-015-9443-2">https://doi.org/10.1007/s10972-015-9443-2</ext-link></comment></element-citation></ref>
<ref id="R72"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lewandowski</surname><given-names>D.</given-names></name><name><surname>Spree</surname><given-names>U.</given-names></name></person-group><year>2011</year><article-title>Ranking of Wikipedia articles in search engines revisited: Fair ranking for reasonable quality</article-title><source>Journal of the American Society for Information Science and Technology</source><volume>62</volume><issue>1</issue><fpage>117</fpage><lpage>132</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/asi.21423">https://doi.org/10.1002/asi.21423</ext-link></comment></element-citation></ref>
<ref id="R73"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Li</surname><given-names>N.</given-names></name><name><surname>Anderson</surname><given-names>A. A.</given-names></name><name><surname>Brossard</surname><given-names>D.</given-names></name><name><surname>Scheufele</surname><given-names>D. A.</given-names></name></person-group><year>2014</year><article-title>Channeling science information seekers&#x2019; attention? A content analysis of top-ranked vs. lower-ranked sites in Google</article-title><source>Journal of Computer-Mediated Communication</source><volume>19</volume><issue>3</issue><fpage>562</fpage><lpage>575</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1111/jcc4.12043">https://doi.org/10.1111/jcc4.12043</ext-link></comment></element-citation></ref>
<ref id="R74"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>MacCarthy</surname><given-names>M.</given-names></name></person-group><year>2019</year><source>Fairness in algorithmic decision-making</source><publisher-name>Brookings Institution</publisher-name><comment><ext-link ext-link-type="uri" xlink:href="https://www.brookings.edu/articles/fairness-in-algorithmic-decision-making/">https://www.brookings.edu/articles/fairness-in-algorithmic-decision-making/</ext-link> (Archived at <ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260322175848/https://www.brookings.edu/articles/fairness-in-algorithmic-decision-making/">https://web.archive.org/web/20260322175848/https://www.brookings.edu/articles/fairness-in-algorithmic-decision-making/</ext-link>)</comment></element-citation></ref>
<ref id="R75"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Mackenzie</surname><given-names>A.</given-names></name></person-group><year>2015</year><article-title>The production of prediction: What does machine learning want</article-title><source>European Journal of Cultural Studies, 18(4&#x2013;5)</source><fpage>429</fpage><lpage>445</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/1367549415577384">https://doi.org/10.1177/1367549415577384</ext-link></comment></element-citation></ref>
<ref id="R76"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Makri</surname><given-names>S.</given-names></name><name><surname>McKay</surname><given-names>D.</given-names></name><name><surname>Buchanan</surname><given-names>G.</given-names></name><name><surname>Chang</surname><given-names>S.</given-names></name><name><surname>Lewandowski</surname><given-names>D.</given-names></name><name><surname>MacFarlane</surname><given-names>A.</given-names></name><name><surname>Cole</surname><given-names>L.</given-names></name><name><surname>Vrijenhoek</surname><given-names>S.</given-names></name><name><surname>Ferraro</surname><given-names>A.</given-names></name></person-group><year>2021</year><article-title>Search a great leveler? Ensuring more equitable information acquisition</article-title><source>Proceedings of the Association for Information Science and Technology</source><volume>58</volume><issue>1</issue><fpage>613</fpage><lpage>618</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/pra2.511">https://doi.org/10.1002/pra2.511</ext-link></comment></element-citation></ref>
<ref id="R77"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Mansoury</surname><given-names>M.</given-names></name><name><surname>Abdollahpouri</surname><given-names>H.</given-names></name><name><surname>Pechenizkiy</surname><given-names>M.</given-names></name><name><surname>Mobasher</surname><given-names>B.</given-names></name><name><surname>Burke</surname><given-names>R.</given-names></name></person-group><year>2020</year><article-title>Feedback loop and bias amplification in recommender systems.</article-title><source>Proceedings of the 29th ACM International Conference on Information and Knowledge Management</source><fpage>2145</fpage><lpage>2148</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3340531.3412152">https://doi.org/10.1145/3340531.3412152</ext-link></comment></element-citation></ref>
<ref id="R78"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>McKearney</surname><given-names>R. M.</given-names></name><name><surname>MacKinnon</surname><given-names>R. C.</given-names></name><name><surname>Smith</surname><given-names>M.</given-names></name><name><surname>Baker</surname><given-names>R.</given-names></name></person-group><year>2018</year><article-title>Tinnitus information online&#x2014; does it ring true</article-title><source>The Journal of Laryngology &amp; Otology</source><volume>132</volume><issue>11</issue><fpage>984</fpage><lpage>989</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1017/S0022215118001792">https://doi.org/10.1017/S0022215118001792</ext-link></comment></element-citation></ref>
<ref id="R79"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Menczer</surname><given-names>F.</given-names></name><name><surname>Pant</surname><given-names>G.</given-names></name><name><surname>Srinivasan</surname><given-names>P.</given-names></name></person-group><year>2004</year><article-title>Topical web crawlers: Evaluating adaptive algorithms</article-title><source>ACM Transactions on Internet Technology</source><volume>4</volume><issue>4</issue><fpage>378</fpage><lpage>419</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1031114.103117">https://doi.org/10.1145/1031114.103117</ext-link></comment></element-citation></ref>
<ref id="R80"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Moses</surname><given-names>L. B.</given-names></name><name><surname>Chan</surname><given-names>J.</given-names></name></person-group><year>2018</year><article-title>Algorithmic prediction in policing: Assumptions, evaluation, and accountability</article-title><source>Policing and Society</source><volume>28</volume><issue>7</issue><fpage>806</fpage><lpage>822</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1080/10439463.2016.1253695">https://doi.org/10.1080/10439463.2016.1253695</ext-link></comment></element-citation></ref>
<ref id="R81"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Moulin</surname><given-names>H.</given-names></name></person-group><year>2004</year><source>Fair division and collective welfare</source><publisher-name>MIT press</publisher-name></element-citation></ref>
<ref id="R82"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Mukherjee</surname><given-names>S.</given-names></name><name><surname>Weikum</surname><given-names>G.</given-names></name></person-group><year>2015</year><article-title>Leveraging joint interactions for credibility analysis in news communities.</article-title><source>Proceedings of the 24th ACM International Conference on Information and Knowledge Management</source><fpage>353</fpage><lpage>362</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/2806416.2806537">https://doi.org/10.1145/2806416.2806537</ext-link></comment></element-citation></ref>
<ref id="R83"><element-citation publication-type="web"><person-group person-group-type="editor"><name><surname>Nahon</surname><given-names>K.</given-names></name></person-group><year>2016</year><article-title>Where there is social media, there is politics</article-title><person-group person-group-type="editor"><name><surname>Bruns</surname><given-names>A.</given-names></name><name><surname>Skogerb&#x00F8;</surname><given-names>E.</given-names></name><name><surname>Christensen</surname><given-names>C.</given-names></name><name><surname>Larsson</surname><given-names>A. O.</given-names></name><name><surname>Enli</surname><given-names>G. S.</given-names></name></person-group><source>The Routledge companion to social media and politics</source><fpage>39</fpage><lpage>55</lpage><publisher-name>Routledge</publisher-name><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.4324/9781315716299">https://doi.org/10.4324/9781315716299</ext-link></comment></element-citation></ref>
<ref id="R84"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Nissenbaum</surname><given-names>H.</given-names></name></person-group><year>2001</year><article-title>How computer systems embody values</article-title><source>Computer</source><volume>34</volume><issue>3</issue><fpage>118</fpage><lpage>119</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1109/2.910905">https://doi.org/10.1109/2.910905</ext-link></comment></element-citation></ref>
<ref id="R85"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Noble</surname><given-names>S.</given-names></name></person-group><year>2012</year><article-title>Missed Connections: What Search Engines Say about Women</article-title><source>Bitch magazine</source><volume>12</volume><issue>4</issue><fpage>37</fpage><lpage>41</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://www.academia.edu/1975319/Missed">https://www.academia.edu/1975319/Missed</ext-link></comment><comment>Connections What Search Engines Say About Women</comment></element-citation></ref>
<ref id="R86"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Noble</surname><given-names>S.</given-names></name></person-group><year>2018</year><source>Algorithms of oppression: Race, gender, and power in the digital age</source><publisher-name>NYU Press</publisher-name></element-citation></ref>
<ref id="R87"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>O&#x2019;Neil</surname><given-names>C.</given-names></name></person-group><year>2017</year><source>Weapons of math destruction: How big data increases inequality and threatens democracy</source><publisher-name>Penguin Books</publisher-name></element-citation></ref>
<ref id="R88"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Page</surname><given-names>M. J.</given-names></name><name><surname>McKenzie</surname><given-names>J. E.</given-names></name><name><surname>Bossuyt</surname><given-names>P. M.</given-names></name><name><surname>Boutron</surname><given-names>I.</given-names></name><name><surname>Hoffmann</surname><given-names>T. C.</given-names></name><name><surname>Mulrow</surname><given-names>C. D.</given-names></name><name><surname>Shamseer</surname><given-names>L.</given-names></name><name><surname>Tetzlaff</surname><given-names>J. M.</given-names></name><name><surname>Akl</surname><given-names>E. A.</given-names></name><name><surname>Brennan</surname><given-names>S. E.</given-names></name><name><surname>Chou</surname><given-names>R.</given-names></name><name><surname>Glanville</surname><given-names>J.</given-names></name><name><surname>Grimshaw</surname><given-names>J. M.</given-names></name><name><surname>Hr&#x00F3;bjartsson</surname><given-names>A.</given-names></name><name><surname>Lalu</surname><given-names>M. M.</given-names></name><name><surname>Li</surname><given-names>T.</given-names></name><name><surname>Loder</surname><given-names>E. W.</given-names></name><name><surname>Mayo-Wilson</surname><given-names>E.</given-names></name><name><surname>McDonald</surname><given-names>S.</given-names></name><name><surname>McGuinness</surname><given-names>L. A.</given-names></name><name><surname>Moher</surname><given-names>D.</given-names></name></person-group><year>2021</year><article-title>The PRISMA 2020 statement: An updated guideline for reporting systematic reviews</article-title><source>BMJ</source><volume>372</volume><fpage>n71</fpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1136/bmj.n71">https://doi.org/10.1136/bmj.n71</ext-link></comment></element-citation></ref>
<ref id="R89"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Pariser</surname><given-names>E.</given-names></name></person-group><year>2012</year><source>The filter bubble: How the new personalized web is changing what we read and how we think</source><publisher-name>Penguin Books</publisher-name></element-citation></ref>
<ref id="R90"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Park</surname><given-names>Y. J.</given-names></name><name><surname>Jang</surname><given-names>S. M.</given-names></name></person-group><year>2016</year><article-title>African American Internet use for information search and privacy protection tasks</article-title><source>Social Science Computer Review</source><volume>34</volume><issue>5</issue><fpage>618</fpage><lpage>630</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/08944393155974">https://doi.org/10.1177/08944393155974</ext-link></comment></element-citation></ref>
<ref id="R91"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Pasquale</surname><given-names>F.</given-names></name></person-group><year>2015</year><source>The black box society: The secret algorithms that control money and information</source><publisher-name>Harvard University Press</publisher-name></element-citation></ref>
<ref id="R92"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Peter</surname><given-names>F.</given-names></name></person-group><year>2017</year><article-title>Political legitimacy</article-title><person-group person-group-type="editor"><name><surname>Zalta</surname><given-names>E. N.</given-names></name></person-group><source>The Stanford encyclopedia of philosophy</source><comment><ext-link ext-link-type="uri" xlink:href="https://plato.stanford.edu/archives/sum2017/entries/legitimacy/">https://plato.stanford.edu/archives/sum2017/entries/legitimacy/</ext-link></comment></element-citation></ref>
<ref id="R93"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Rahimi</surname><given-names>M. A.</given-names></name><name><surname>Eulenberg</surname><given-names>J. B.</given-names></name></person-group><year>1974</year><article-title>A computing environment for the blind.</article-title><source>Proceedings of the National Computer Conference and Exposition</source><fpage>121</fpage><lpage>124</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1500175.1500197">https://doi.org/10.1145/1500175.1500197</ext-link></comment></element-citation></ref>
<ref id="R94"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Rekabsaz</surname><given-names>N.</given-names></name><name><surname>Kopeinik</surname><given-names>S.</given-names></name><name><surname>Schedl</surname><given-names>M.</given-names></name></person-group><year>2021</year><article-title>Societal biases in retrieved contents: Measurement framework and adversarial mitigation of BERT rankers.</article-title><source>Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>306</fpage><lpage>316</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3404835.3462949">https://doi.org/10.1145/3404835.3462949</ext-link></comment></element-citation></ref>
<ref id="R95"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Rey</surname><given-names>B.</given-names></name><name><surname>Kannan</surname><given-names>A.</given-names></name></person-group><year>2010</year><article-title>Conversion rate based bid adjustment for sponsored search.</article-title><source>Proceedings of the 19th International Conference on World Wide Web</source><fpage>1173</fpage><lpage>1174</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1772690.1772860">https://doi.org/10.1145/1772690.1772860</ext-link></comment></element-citation></ref>
<ref id="R96"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Richardson</surname><given-names>R.</given-names></name><name><surname>Schultz</surname><given-names>J. M.</given-names></name><name><surname>Crawford</surname><given-names>K.</given-names></name></person-group><year>2019</year><article-title>Dirty data, bad predictions: How civil rights violations impact police data, predictive policing systems, and justice</article-title><source>New York University Law Review</source><volume>94</volume><issue>1</issue><fpage>15</fpage><lpage>55</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://nyulawreview.org/online-features/dirty-data-bad-predictions-how-civil-rights-violations-impact-police-data-predictive-policing-systems-and-justice/">https://nyulawreview.org/online-features/dirty-data-bad-predictions-how-civil-rights-violations-impact-police-data-predictive-policing-systems-and-justice/</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260416223004/https://nyulawreview.org/online-features/dirty-data-bad-predictions-how-civil-rights-violations-impact-police-data-predictive-policing-systems-and-justice/">https://web.archive.org/web/20260416223004/https://nyulawreview.org/online-features/dirty-data-bad-predictions-how-civil-rights-violations-impact-police-data-predictive-policing-systems-and-justice/</ext-link></comment></element-citation></ref>
<ref id="R97"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rieger</surname><given-names>A.</given-names></name><name><surname>Draws</surname><given-names>T.</given-names></name><name><surname>Theune</surname><given-names>M.</given-names></name><name><surname>Tintarev</surname><given-names>N.</given-names></name></person-group><year>2024</year><article-title>Nudges to mitigate confirmation bias during web search on debated topics: Support vs. manipulation</article-title><source>ACM Transactions on the Web</source><volume>18</volume><issue>2</issue><fpage>1</fpage><lpage>27</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3635034">https://doi.org/10.1145/3635034</ext-link></comment></element-citation></ref>
<ref id="R98"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Rolf</surname><given-names>E.</given-names></name><name><surname>Worledge</surname><given-names>T.</given-names></name><name><surname>Recht</surname><given-names>B.</given-names></name><name><surname>Jordan</surname><given-names>M. I.</given-names></name></person-group><year>2021</year><article-title>Representation matters: Assessing the importance of subgroup allocations in training data</article-title><source>arXiv preprint arXiv:2103.03399</source><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.48550/arXiv.2103.03399">https://doi.org/10.48550/arXiv.2103.03399</ext-link></comment></element-citation></ref>
<ref id="R99"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Roy</surname><given-names>D.</given-names></name><name><surname>Mitra</surname><given-names>M.</given-names></name><name><surname>Ganguly</surname><given-names>D.</given-names></name></person-group><year>2018</year><article-title>To clean or not to clean: Document preprocessing and reproducibility</article-title><source>Journal of Data and Information Quality</source><volume>10</volume><issue>4</issue><comment>Article 18, 1&#x2013;25</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3242180">https://doi.org/10.1145/3242180</ext-link></comment></element-citation></ref>
<ref id="R100"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sakai</surname><given-names>T.</given-names></name><name><surname>Kim</surname><given-names>J. Y.</given-names></name><name><surname>Kang</surname><given-names>I.</given-names></name></person-group><year>2023</year><article-title>A versatile framework for evaluating ranked lists in terms of group fairness and relevance</article-title><source>ACM Transactions on Information Systems</source><volume>42</volume><issue>1</issue><fpage>1</fpage><lpage>36</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3589763">https://doi.org/10.1145/3589763</ext-link></comment></element-citation></ref>
<ref id="R101"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Sambasivan</surname><given-names>N.</given-names></name><name><surname>Arnesen</surname><given-names>E.</given-names></name><name><surname>Hutchinson</surname><given-names>B.</given-names></name><name><surname>Prabhakaran</surname><given-names>V.</given-names></name></person-group><year>2020</year><article-title>Non-portability of algorithmic fairness in India</article-title><source>arXiv preprint arXiv:2012.03659</source><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.48550/arXiv.2012.03659">https://doi.org/10.48550/arXiv.2012.03659</ext-link></comment></element-citation></ref>
<ref id="R102"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Selbst</surname><given-names>A. D.</given-names></name><name><surname>Boyd</surname><given-names>D.</given-names></name><name><surname>Friedler</surname><given-names>S. A.</given-names></name><name><surname>Venkatasubramanian</surname><given-names>S.</given-names></name><name><surname>Vertesi</surname><given-names>J.</given-names></name></person-group><year>2019</year><article-title>Fairness and abstraction in sociotechnical systems.</article-title><source>Proceedings of the Conference on Fairness, Accountability, and Transparency</source><fpage>59</fpage><lpage>68</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3287560.3287598">https://doi.org/10.1145/3287560.3287598</ext-link></comment></element-citation></ref>
<ref id="R103"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Schmidt</surname><given-names>C.</given-names></name><name><surname>Gorman</surname><given-names>T. J.</given-names></name><name><surname>Bayor</surname><given-names>A. A.</given-names></name><name><surname>Gary</surname><given-names>M. S.</given-names></name></person-group><year>2010</year><article-title>Impact of low-cost, on-demand information access in a remote Ghanaian village.</article-title><source>Proceedings of the 4th ACM/IEEE International Conference on Information and Communication Technologies and Development</source><fpage>1</fpage><lpage>10</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://dl.acm.org/doi/10.1145/2369220.2369261">https://dl.acm.org/doi/10.1145/2369220.2369261</ext-link></comment></element-citation></ref>
<ref id="R104"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Shah</surname><given-names>C.</given-names></name><name><surname>Bender</surname><given-names>E. M.</given-names></name></person-group><year>2024</year><article-title>Envisioning information access systems: What makes for good tools and a healthy Web</article-title><source>ACM Transactions on the Web</source><volume>18</volume><issue>3</issue><fpage>1</fpage><lpage>24</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3649468">https://doi.org/10.1145/3649468</ext-link></comment></element-citation></ref>
<ref id="R105"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sonboli</surname><given-names>N.</given-names></name><name><surname>Burke</surname><given-names>R.</given-names></name><name><surname>Ekstrand</surname><given-names>M.</given-names></name><name><surname>Mehrotra</surname><given-names>R.</given-names></name></person-group><year>2022</year><article-title>The multisided complexity of fairness in recommender systems</article-title><source>AI Magazine</source><volume>43</volume><issue>2</issue><fpage>164</fpage><lpage>176</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/aaai.12054">https://doi.org/10.1002/aaai.12054</ext-link></comment></element-citation></ref>
<ref id="R106"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sonnenberg</surname><given-names>C.</given-names></name></person-group><year>2020</year><article-title>E-government and social media: The impact on accessibility</article-title><source>Journal of Disability Policy Studies</source><volume>31</volume><issue>3</issue><fpage>181</fpage><lpage>191</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1177/1044207320906521">https://doi.org/10.1177/1044207320906521</ext-link></comment></element-citation></ref>
<ref id="R107"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Spinelli</surname><given-names>L.</given-names></name><name><surname>Crovella</surname><given-names>M.</given-names></name></person-group><year>2020</year><article-title>How YouTube leads privacy-seeking users away from reliable information.</article-title><source>Adjunct Publication of the 28th ACM Conference on User Modeling, Adaptation and Personalization</source><fpage>244</fpage><lpage>251</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3386392.3399566">https://doi.org/10.1145/3386392.3399566</ext-link></comment></element-citation></ref>
<ref id="R108"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname><given-names>Z.</given-names></name><name><surname>Di</surname><given-names>L.</given-names></name><name><surname>Heo</surname><given-names>G.</given-names></name><name><surname>Zhang</surname><given-names>C.</given-names></name><name><surname>Fang</surname><given-names>H.</given-names></name><name><surname>Yue</surname><given-names>P.</given-names></name><name><surname>Wang</surname><given-names>X.</given-names></name><name><surname>Lin</surname><given-names>L.</given-names></name></person-group><year>2017</year><article-title>GeoFairy: Towards a one-stop and location-based service for geospatial information retrieval</article-title><source>Computers, Environment and Urban Systems</source><volume>62</volume><fpage>156</fpage><lpage>167</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.compenvurbsys.2016.11.007">https://doi.org/10.1016/j.compenvurbsys.2016.11.007</ext-link></comment></element-citation></ref>
<ref id="R109"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Sun</surname><given-names>W.</given-names></name><name><surname>Nasraoui</surname><given-names>O.</given-names></name><name><surname>Shafto</surname><given-names>P.</given-names></name></person-group><year>2018</year><article-title>Iterated algorithmic bias in the interactive machine learning process of information filtering.</article-title><source>Proceedings of the 10th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management</source><fpage>108</fpage><lpage>116</lpage><publisher-name>SCITEPRESS</publisher-name><comment><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5220/0006938301100118">https://doi.org/10.5220/0006938301100118</ext-link></comment></element-citation></ref>
<ref id="R110"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Tufekci</surname><given-names>Z.</given-names></name></person-group><year>2015</year><article-title>Algorithmic harms beyond Facebook and Google: Emergent challenges of computational agency</article-title><source>Journal on Telecommunications &amp; High Technology Law</source><volume>13</volume><issue>2</issue><fpage>203</fpage><lpage>216</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://ctlj.colorado.edu/wp-content/uploads/2015/08/Tufekci-final.pdf">https://ctlj.colorado.edu/wp-content/uploads/2015/08/Tufekci-final.pdf</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260421173754/https://ctlj.colorado.edu/wp-content/uploads/2015/08/Tufekci-final.pdf">https://web.archive.org/web/20260421173754/https://ctlj.colorado.edu/wp-content/uploads/2015/08/Tufekci-final.pdf</ext-link></comment></element-citation></ref>
<ref id="R111"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Udoh</surname><given-names>E. S.</given-names></name><name><surname>Yuan</surname><given-names>X.</given-names></name><name><surname>Rorissa</surname><given-names>A.</given-names></name></person-group><year>2022</year><article-title>Rethinking algorithmic fairness in the context of information access</article-title><source>Proceedings of the Association for Information Science and Technology</source><volume>59</volume><issue>1</issue><fpage>815</fpage><lpage>817</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/pra2.736">https://doi.org/10.1002/pra2.736</ext-link></comment></element-citation></ref>
<ref id="R112"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Udoh</surname><given-names>E.</given-names></name><name><surname>Yuan</surname><given-names>X.</given-names></name><name><surname>Rorissa</surname><given-names>A.</given-names></name></person-group><year>2024</year><article-title>A framework for defining algorithmic fairness in the context of information access</article-title><source>Proceedings of the Association for Information Science and Technology</source><volume>61</volume><issue>1</issue><fpage>667</fpage><lpage>672</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/pra2.1077">https://doi.org/10.1002/pra2.1077</ext-link></comment></element-citation></ref>
<ref id="R113"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Venkatasubramanian</surname><given-names>S.</given-names></name><name><surname>Scheidegger</surname><given-names>C.</given-names></name><name><surname>Friedler</surname><given-names>S.</given-names></name><name><surname>Clauset</surname><given-names>A.</given-names></name></person-group><year>2021</year><article-title>Fairness in networks: Social capital, information access, and interventions.</article-title><source>Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</source><fpage>4078</fpage><lpage>4079</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3447548.3470821">https://doi.org/10.1145/3447548.3470821</ext-link></comment></element-citation></ref>
<ref id="R114"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wachter</surname><given-names>S.</given-names></name><name><surname>Mittelstadt</surname><given-names>B.</given-names></name></person-group><year>2019</year><article-title>A right to reasonable inferences: Re-thinking data protection law in the age of big data and AI</article-title><source>Columbia Business Law Review</source><volume>2019</volume><issue>2</issue><fpage>494</fpage><lpage>620</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://papers.ssrn.com/sol3/papers.cfm?abstractid=3248829">https://papers.ssrn.com/sol3/papers.cfm?abstractid=3248829</ext-link></comment><comment>Archived at</comment><comment><ext-link ext-link-type="uri" xlink:href="https://web.archive.org/web/20260414121218/https://papers.ssrn.com/sol3/papers.cfm?abstractid=3248829">https://web.archive.org/web/20260414121218/https://papers.ssrn.com/sol3/papers.cfm?abstractid=3248829</ext-link></comment></element-citation></ref>
<ref id="R115"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Webb</surname><given-names>H.</given-names></name><name><surname>Koene</surname><given-names>A.</given-names></name><name><surname>Patel</surname><given-names>M.</given-names></name><name><surname>Vallejos</surname><given-names>E. P.</given-names></name></person-group><year>2018</year><article-title>Multi-stakeholder dialogue for policy recommendations on algorithmic fairness.</article-title><source>Proceedings of the 9th International Conference on Social Media and Society</source><fpage>395</fpage><lpage>399</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3217804.3217952">https://doi.org/10.1145/3217804.3217952</ext-link></comment></element-citation></ref>
<ref id="R116"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>White</surname><given-names>R. W.</given-names></name><name><surname>Hassan</surname><given-names>A.</given-names></name></person-group><year>2014</year><article-title>Content bias in online health search</article-title><source>ACM Transactions on the Web</source><volume>8</volume><issue>4</issue><fpage>1</fpage><lpage>33</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/2663355">https://doi.org/10.1145/2663355</ext-link></comment></element-citation></ref>
<ref id="R117"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Wu</surname><given-names>H.</given-names></name><name><surname>Mitra</surname><given-names>B.</given-names></name><name><surname>Ma</surname><given-names>C.</given-names></name><name><surname>Diaz</surname><given-names>F.</given-names></name><name><surname>Liu</surname><given-names>X.</given-names></name></person-group><year>2022</year><article-title>Joint multisided exposure fairness for recommendation.</article-title><source>Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source><fpage>703</fpage><lpage>714</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/3477495.3532007">https://doi.org/10.1145/3477495.3532007</ext-link></comment></element-citation></ref>
<ref id="R118"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname><given-names>Y. T.</given-names></name><name><surname>Chen</surname><given-names>B.</given-names></name></person-group><year>2015</year><article-title>Web accessibility for older adults: A comparative analysis of disability laws</article-title><source>The Gerontologist</source><volume>55</volume><issue>5</issue><fpage>854</fpage><lpage>865</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1093/geront/gnv057">https://doi.org/10.1093/geront/gnv057</ext-link></comment></element-citation></ref>
<ref id="R119"><element-citation publication-type="web"><person-group person-group-type="author"><name><surname>Yue</surname><given-names>Y.</given-names></name><name><surname>Patel</surname><given-names>R.</given-names></name><name><surname>Roehrig</surname><given-names>H.</given-names></name></person-group><year>2010</year><article-title>Beyond position bias: Examining result attractiveness as a source of presentation bias in clickthrough data.</article-title><source>Proceedings of the 19th International Conference on the World Wide Web</source><fpage>1011</fpage><lpage>1018</lpage><comment>Association for Computing Machinery</comment><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1145/1772690.1772793">https://doi.org/10.1145/1772690.1772793</ext-link></comment></element-citation></ref>
<ref id="R120"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zambonelli</surname><given-names>F.</given-names></name><name><surname>Salim</surname><given-names>F.</given-names></name><name><surname>Loke</surname><given-names>S. W.</given-names></name><name><surname>De Meuter</surname><given-names>W.</given-names></name><name><surname>Kanhere</surname><given-names>S.</given-names></name></person-group><year>2018</year><article-title>Algorithmic governance in smart cities: The conundrum and the potential of pervasive computing solutions</article-title><source>IEEE Technology and Society Magazine</source><volume>37</volume><issue>2</issue><fpage>80</fpage><lpage>87</lpage><comment><ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1109/MTS.2018.2826080">https://doi.org/10.1109/MTS.2018.2826080</ext-link></comment></element-citation></ref>
<ref id="R121"><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zarsky</surname><given-names>T.</given-names></name></person-group><year>2016</year><article-title>The trouble with algorithmic decisions: An analytic road map to examine efficiency and fairness in automated and opaque decision making</article-title><source>Science, Technology, &amp; Human Values</source><volume>41</volume><issue>1</issue><fpage>118</fpage><lpage>132</lpage><comment><ext-link ext-link-type="uri" xlink:href="https://www.jstor.org/stable/43671285">https://www.jstor.org/stable/43671285</ext-link></comment></element-citation></ref>
</ref-list>
</back>
</article>