{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:48:50Z","timestamp":1765295330110,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T00:00:00Z","timestamp":1663113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T00:00:00Z","timestamp":1663113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Hum-Cent Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Personalized recommendation based on multi-arm bandit (MAB) algorithms has shown to lead to high utility and efficiency as it can dynamically adapt the recommendation strategy based on feedback. However, unfairness could incur in personalized recommendation. In this paper, we study how to achieve user-side fairness in personalized recommendation. We formulate our fair personalized recommendation as a modified contextual bandit and focus on achieving fairness on the individual whom is being recommended an item as opposed to achieving fairness on the items that are being recommended. We introduce and define a metric that captures the fairness in terms of rewards received for both the privileged and protected groups. We develop a fair contextual bandit algorithm, Fair-LinUCB, that improves upon the traditional LinUCB algorithm to achieve group-level fairness of users. Our algorithm detects and monitors unfairness while it learns to recommend personalized videos to students to achieve high efficiency. We provide a theoretical regret analysis and show that our algorithm has a slightly higher regret bound than LinUCB. We conduct numerous experimental evaluations to compare the performances of our fair contextual bandit to that of LinUCB and show that our approach achieves group-level fairness while maintaining a high utility.<\/jats:p>","DOI":"10.1007\/s44230-022-00008-w","type":"journal-article","created":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T15:02:26Z","timestamp":1663167746000},"page":"81-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Achieving User-Side Fairness in Contextual Bandits"],"prefix":"10.1007","volume":"2","author":[{"given":"Wen","family":"Huang","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Labille","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3063","authenticated-orcid":false,"given":"Xintao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Dongwon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Neil","family":"Heffernan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"8_CR1","unstructured":"Abbasi-Yadkori Y, P\u00e1l D, Szepesv\u00e1ri C. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems, 2011;2312\u20132320."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bouneffouf D, Rish I, Aggarwal CC. Survey on applications of multi-armed and contextual bandits. In IEEE Congress on Evolutionary Computation, CEC, Glasgow, United Kingdom, July 19\u201324, 2020. IEEE. 2020;2020:1\u20138.","DOI":"10.1109\/CEC48606.2020.9185782"},{"key":"8_CR3","unstructured":"Burke R, Sonboli N, Ordonez-Gauger A. Balanced neighborhoods for multi-sided fairness in recommendation. In Conference on Fairness, Accountability and Transparency, 2018;202\u2013214."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Celis LE, Kapoor S, Salehi F, Vishnoi NK. An algorithmic framework to control bias in bandit-based personalization. arXiv:1802.08674, 2018.","DOI":"10.24963\/ijcai.2018\/854"},{"key":"8_CR5","unstructured":"Chen Y, Cuellar A, Luo H, Modi J, Nemlekar H, Nikolaidis S, Fair contextual multi-armed bandits: Theory and experiments. In Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, PMLR, 2020;181\u2013190."},{"key":"8_CR6","unstructured":"Chiappa S, Gillam TPS, Path-Specific Counterfactual Fairness, arXiv preprint arXiv:1802.08139, 2018."},{"key":"8_CR7","unstructured":"Chu W, Li L, Reyzin L, Schapire R, Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011;208\u2013214."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Dee S T, Teachers and the gender gaps in student achievement, Journal of Human Resources, 2007;528\u2013554.","DOI":"10.3368\/jhr.XLII.3.528"},{"key":"8_CR9","unstructured":"Dua D, Graff C, UCI machine learning repository, 2017, http:\/\/archive.ics.uci.edu\/ml."},{"key":"8_CR10","unstructured":"Ekstrand MD, Tian M, Azpiazu IM, Ekstrand JD, Anuyah O, McNeill D, Pera MS, All the cool kids, how do they fit in?: Popularity and demographic biases in recommender evaluation and effectiveness. In Conference on Fairness, Accountability and Transparency, FAT 2018, 23-24 February 2018, New York, NY, USA, vol.\u00a081 of Proceedings of Machine Learning Research, PMLR, 2018, pp.\u00a0172\u2013186."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ekstrand MD, Tian M, Kazi MRI, Mehrpouyan H, Kluver D, Exploring author gender in book rating and recommendation. In Proceedings of the 12th ACM Conference on Recommender Systems, 2018; 242\u2013250.","DOI":"10.1145\/3240323.3240373"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"E4512","DOI":"10.1073\/pnas.1419828112","volume":"112","author":"R Epstein","year":"2015","unstructured":"Epstein R, Robertson RE. The search engine manipulation effect (seme) and its possible impact on the outcomes of elections. Proc Natl Acad Sci. 2015;112:E4512\u201321.","journal-title":"Proc Natl Acad Sci"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Farahat A, Bailey MC, How effective is targeted advertising?. In Proceedings of the 21st international conference on World Wide Web, ACM, 2012;111\u2013120.","DOI":"10.1145\/2187836.2187852"},{"key":"8_CR14","unstructured":"Ghalme G, Jain S, Gujar S, Narahari Y, Thompson sampling based mechanisms for stochastic multi-armed bandit problems. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S\u00e3o Paulo, Brazil, May 8-12, 2017, ACM, 2017;87\u201395."},{"key":"8_CR15","unstructured":"Gillen S, Jung C, Kearns MJ, Roth A, Online learning with an unknown fairness metric. In Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montr\u00e9al, Canada, 2018;2605\u20132614."},{"key":"8_CR16","unstructured":"Gur Y, Zeevi AJ, Besbes O, Stochastic multi-armed-bandit problem with non-stationary rewards. In Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada, 2014;199\u2013207."},{"key":"8_CR17","unstructured":"Hardt M, Price E, Srebro N. et\u00a0al. Equality of opportunity in supervised learning. In Advances in neural information processing systems, 2016;3315\u20133323."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Heidari H, Krause A, Preventing disparate treatment in sequential decision making. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, ijcai.org, 2018;2248\u20132254.","DOI":"10.24963\/ijcai.2018\/311"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Hoffmann F, Oreopoulos P, A professor like me the influence of instructor gender on college achievement, Journal of Human Resources, 2009;479\u2013494.","DOI":"10.1353\/jhr.2009.0024"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Huang W, Labille K, Wu X, Lee D, Heffernan N, Fairness-aware Bandit-based Recommendation. In Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), Orlando, FL, USA, December 15-18, 2021;1273\u20131278.","DOI":"10.1109\/BigData52589.2021.9671959"},{"key":"8_CR21","unstructured":"Jabbari S, Joseph M, Kearns MJ, Morgenstern J, Roth A, Fairness in reinforcement learning. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, vol.\u00a070 of Proceedings of Machine Learning Research, PMLR, 2017;1617\u20131626."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Joseph M, Kearns MJ, Morgenstern J, Neel S, Roth A, Meritocratic fairness for infinite and contextual bandits. In Proceedings of the 2018 AAAI\/ACM Conference on AI, Ethics, and Society, AIES 2018, New Orleans, LA, USA, February 02-03, 2018, ACM, 2018;158\u2013163.","DOI":"10.1145\/3278721.3278764"},{"key":"8_CR23","unstructured":"Joseph M, Kearns MJ, Morgenstern JH, Roth A, Fairness in learning: Classic and contextual bandits. In Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, 2016;325\u2013333."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/moor.12.2.262","volume":"12","author":"MN Katehakis","year":"1987","unstructured":"Katehakis MN, Veinott AF Jr. The multi-armed bandit problem: decomposition and computation. Math Oper Res. 1987;12:262\u20138.","journal-title":"Math Oper Res"},{"key":"8_CR25","unstructured":"Kusner MJ, Loftus J, Russell C, Silva R, Counterfactual fairness. In Advances in Neural Information Processing Systems, 2017;4066\u20134076."},{"key":"8_CR26","unstructured":"Langford J, Zhang T, The epoch-greedy algorithm for contextual multi-armed bandits. In Proceedings of the 20th International Conference on Neural Information Processing Systems, Citeseer, 2007;817\u2013824."},{"key":"8_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore T, Szepesv\u00e1ri C. Bandit algorithms. Cambridge University Press; 2020."},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Li F, Liu J, Ji B, Combinatorial sleeping bandits with fairness constraints. In 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019, IEEE, 2019;1702\u20131710.","DOI":"10.1109\/INFOCOM.2019.8737461"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Li L, Chu W, Langford J, Schapire RE, A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web, ACM, 2010;661\u2013670.","DOI":"10.1145\/1772690.1772758"},{"key":"8_CR30","unstructured":"Liu Y, Radanovic G, Dimitrakakis C, Mandal D, Parkes DC, Calibrated fairness in bandits, arXiv preprint arXiv:1707.01875, 2017."},{"key":"8_CR31","unstructured":"Metevier B, Giguere S, Brockman S, Kobren A, Brun Y, Brunskill E, Thomas PS, Offline contextual bandits with high probability fairness guarantees. In Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada, 2019;14893\u201314904."},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Patil V, Ghalme G, Nair V, Narahari Y, Achieving fairness in the stochastic multi-armed bandit problem. In Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, (AAAI-20), New York, New York, USA, February 7-12, 2020;5379\u20135386.","DOI":"10.1609\/aaai.v34i04.5986"},{"key":"8_CR33","unstructured":"Russell C, Kusner MJ, Loftus J, Silva R, When worlds collide: integrating different counterfactual assumptions in fairness. In Advances in Neural Information Processing Systems, 2017;6414\u20136423."},{"key":"8_CR34","unstructured":"Sun Y, Ram\u00edrez I, Cuesta-Infante A, Veeramachaneni K, Learning fair classifiers in online stochastic settings, CoRR, abs\/1908.07009 2019."},{"key":"8_CR35","unstructured":"Syrgkanis V, Krishnamurthy A, Schapire RE, Efficient algorithms for adversarial contextual learning. In Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016, vol.\u00a048 of JMLR Workshop and Conference Proceedings, JMLR.org, 2016;2159\u20132168."},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Wu Q, Wang H, Gu Q, Wang H, Contextual bandits in a collaborative environment. In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016;529\u2013538.","DOI":"10.1145\/2911451.2911528"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhang L, Wu, Counterfactual fairness: Unidentification, bound and algorithm. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, International Joint Conferences on Artificial Intelligence Organization, 2019;1438\u20131444.","DOI":"10.24963\/ijcai.2019\/199"},{"key":"8_CR38","unstructured":"Wu Y, Zhang L, Wu X, Tong H, PC-Fairness: A Unified Framework for Measuring Causality-based Fairness. In Annual Conference on Neural Information Processing Systems 2019, December 8-14, 2019, Vancouver, Canada, 2019, Curran Associates, Inc., Dec. 2019;3399\u20133409."},{"key":"8_CR39","unstructured":"Yao S, Huang B, Beyond parity: Fairness objectives for collaborative filtering. In Annual Conference on Neural Information Processing Systems 2017, 4-9 December 2017, Long Beach, CA, USA, 2017;2921\u20132930."},{"key":"8_CR40","unstructured":"Yang S, Ren T, Shakkottai S, Price E, Dhillon IS, Sanghavi S, Linear bandit algorithms with sublinear time complexity, arXiv preprint arXiv:2103.02729, 2021."},{"key":"8_CR41","unstructured":"Zafar MB, Valera I, Rodriguez MG, Gummadi KP, Fairness constraints: Mechanisms for fair classification. In AISTATS, 2017."},{"key":"8_CR42","unstructured":"Zhang J, Bareinboim E, Fairness in decision-making - the causal explanation formula. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, Feb. 2018;2037\u20132045."},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Zhang L, Wu Y, Wu X, A causal framework for discovering and removing direct and indirect discrimination. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, 2017;3929\u20133935.","DOI":"10.24963\/ijcai.2017\/549"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Zhu Z, Hu X, Caverlee J, Fairness-aware tensor-based recommendation. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management, ACM, 2018;1153\u20131162.","DOI":"10.1145\/3269206.3271795"}],"container-title":["Human-Centric Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44230-022-00008-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44230-022-00008-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44230-022-00008-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T13:10:31Z","timestamp":1670418631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44230-022-00008-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,14]]},"references-count":44,"journal-issue":{"issue":"3-4","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["8"],"URL":"https:\/\/doi.org\/10.1007\/s44230-022-00008-w","relation":{},"ISSN":["2667-1336"],"issn-type":[{"type":"electronic","value":"2667-1336"}],"subject":[],"published":{"date-parts":[[2022,9,14]]},"assertion":[{"value":"15 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to participate"}},{"value":"The authors declare consent for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare they have no conflicts of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}