{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:08:48Z","timestamp":1778836128055,"version":"3.51.4"},"reference-count":0,"publisher":"University of Bor\u00e5s","issue":"2","license":[{"start":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:00:00Z","timestamp":1778803200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IR"],"abstract":"<jats:p>Introduction. 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 (\u2018Fair Algorithms for Information Retrieval and Seeking\u2019) framework to address the pressing need for a comprehensive conceptualisation of algorithmic fairness in the context of information access.\nMethod. 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.\nAnalysis. 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.\nResults. 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\u2014core components reflected in FAIRS.\nConclusions. 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.<\/jats:p>","DOI":"10.47989\/ir31262019","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T08:22:09Z","timestamp":1778833329000},"page":"320-347","source":"Crossref","is-referenced-by-count":0,"title":["FAIRS: a framework for rethinking algorithmic fairness in the context of information access"],"prefix":"10.47989","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8255-6499","authenticated-orcid":false,"given":"Emmanuel","family":"Udoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6538-8275","authenticated-orcid":false,"given":"Xiaojun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5300-617X","authenticated-orcid":false,"given":"Abebe","family":"Rorrissa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27919","published-online":{"date-parts":[[2026,5,15]]},"container-title":["Information Research an international electronic journal"],"original-title":[],"link":[{"URL":"https:\/\/publicera.kb.se\/ir\/article\/download\/62019\/52806","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/publicera.kb.se\/ir\/article\/download\/62019\/52806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T08:22:10Z","timestamp":1778833330000},"score":1,"resource":{"primary":{"URL":"https:\/\/publicera.kb.se\/ir\/article\/view\/62019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,15]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,5,15]]}},"URL":"https:\/\/doi.org\/10.47989\/ir31262019","relation":{},"ISSN":["1368-1613"],"issn-type":[{"value":"1368-1613","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,15]]}}}