{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T06:31:50Z","timestamp":1782801110358,"version":"3.54.5"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["IIS-1911025 and IIS-2107577"],"award-info":[{"award-number":["IIS-1911025 and IIS-2107577"]}]},{"name":"NSF","award":["IIS-2107505"],"award-info":[{"award-number":["IIS-2107505"]}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"crossref","award":["APVV-20-0353"],"award-info":[{"award-number":["APVV-20-0353"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Recomm. Syst."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Algorithmic fairness in the context of personalized recommendation presents significantly different challenges to those commonly encountered in classification tasks. Researchers studying classification have generally considered fairness to be a matter of achieving equality of outcomes (or some other metric) between a protected and unprotected group and built algorithmic interventions on this basis. We argue that fairness in real-world application settings in general, and especially in the context of personalized recommendation, is much more complex and multi-faceted, requiring a more general approach. To address the fundamental problem of fairness in the presence of multiple stakeholders, with different definitions of fairness, we propose the Social Choice for Recommendation Under Fairness\u2013Dynamic architecture, which formalizes multistakeholder fairness in recommender systems as a two-stage social choice problem. In particular, we express recommendation fairness as a combination of an allocation and an aggregation problem, which integrate both fairness concerns and personalized recommendation provisions, and derive new recommendation techniques based on this formulation. We demonstrate the ability of our framework to dynamically incorporate multiple fairness concerns using both real-world and synthetic datasets.<\/jats:p>","DOI":"10.1145\/3690653","type":"journal-article","created":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T09:07:44Z","timestamp":1727514464000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic Fairness-aware Recommendation Through Multi-agent Social Choice"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0348-5843","authenticated-orcid":false,"given":"Amanda","family":"Aird","sequence":"first","affiliation":[{"name":"Information Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8487-5039","authenticated-orcid":false,"given":"Paresha","family":"Farastu","sequence":"additional","affiliation":[{"name":"Computer Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0150-674X","authenticated-orcid":false,"given":"Joshua","family":"Sun","sequence":"additional","affiliation":[{"name":"Computer Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8683-939X","authenticated-orcid":false,"given":"Elena","family":"Stefancov\u00e1","sequence":"additional","affiliation":[{"name":"Computer Science, Comenius University in Bratislava, Bratislava, Slovakia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7603-9951","authenticated-orcid":false,"given":"Cassidy","family":"All","sequence":"additional","affiliation":[{"name":"Computer Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2490-2063","authenticated-orcid":false,"given":"Amy","family":"Voida","sequence":"additional","affiliation":[{"name":"Information Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3569-4335","authenticated-orcid":false,"given":"Nicholas","family":"Mattei","sequence":"additional","affiliation":[{"name":"Computer Science, Tulane University, New Orleans, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5766-6434","authenticated-orcid":false,"given":"Robin","family":"Burke","sequence":"additional","affiliation":[{"name":"Information Science, University of Colorado at Boulder, Boulder, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/3514094.3534173","volume-title":"Proceedings of the AAAI\/ACM Conference on AI, Ethics, and Society","author":"Akpinar Nil-Jana","year":"2022","unstructured":"Nil-Jana Akpinar, Cyrus DiCiccio, Preetam Nandy, and Kinjal Basu. 2022. Long-term dynamics of fairness intervention in connection recommender systems. In Proceedings of the AAAI\/ACM Conference on AI, Ethics, and Society. ACM, New York, NY, 22\u201335."},{"key":"e_1_3_3_3_2","first-page":"2540","volume-title":"Proceedings of the 24th International Joint Conference on AI (IJCAI\u201915)","author":"Aleksandrov M.","year":"2015","unstructured":"M. Aleksandrov, H. Aziz, S. Gaspers, and T. Walsh. 2015. Online fair division: Analysing a food bank problem. In Proceedings of the 24th International Joint Conference on AI (IJCAI\u201915). IJCAI, 2540\u20132546."},{"key":"e_1_3_3_4_2","first-page":"25","article-title":"Fair division of indivisible goods: Recent progress and open questions","volume":"322","author":"Amanatidis Georgios","year":"2023","unstructured":"Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Herv\u00e9 Moulin, Alexandros A. Voudouris, and Xiaowei Wu. 2023. Fair division of indivisible goods: Recent progress and open questions. Artif. Intell. 322 (2023), 25 pages.","journal-title":"Artif. Intell."},{"key":"e_1_3_3_5_2","first-page":"405","volume-title":"Proceedings of the 21st International Joint Conference on AI (IJCAI\u201909)","author":"Awasthi P.","year":"2009","unstructured":"P. Awasthi and T. Sandholm. 2009. Online stochastic optimization in the large: Application to kidney exchange. In Proceedings of the 21st International Joint Conference on AI (IJCAI\u201909). IJCAI, 405\u2013411."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.15779\/Z38BG31"},{"issue":"2","key":"e_1_3_3_7_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1006\/jeth.2000.2710","article-title":"A new solution to the random assignment problem","volume":"100","author":"Bogomolnaia Anna","year":"2001","unstructured":"Anna Bogomolnaia and Herv\u00e9 Moulin. 2001. A new solution to the random assignment problem. J. Econ. Theory 100, 2 (2001), 295\u2013328.","journal-title":"J. Econ. Theory"},{"key":"e_1_3_3_8_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"Brandt F.","year":"2016","unstructured":"F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia (Eds.). 2016. Handbook of Computational Social Choice. Cambridge University Press."},{"issue":"2","key":"e_1_3_3_9_2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1257\/aer.103.2.585","article-title":"Designing random allocation mechanisms: Theory and applications","volume":"103","author":"Budish Eric","year":"2013","unstructured":"Eric Budish, Yeon-Koo Che, Fuhito Kojima, and Paul Milgrom. 2013. Designing random allocation mechanisms: Theory and applications. Am. Econ. Rev. 103, 2 (2013), 585\u2013623.","journal-title":"Am. Econ. Rev."},{"key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/3511047.3538031","volume-title":"Adjunct Proceedings of the 30th ACM Conference on User Modeling, Adaptation and Personalization","author":"Buet-Golfouse Francois","year":"2022","unstructured":"Francois Buet-Golfouse and Islam Utyagulov. 2022. Towards fair multi-stakeholder recommender systems. In Adjunct Proceedings of the 30th ACM Conference on User Modeling, Adaptation and Personalization. ACM, New York, NY, 255\u2013265."},{"key":"e_1_3_3_11_2","unstructured":"Robin Burke. 2017. Multisided Fairness for Recommendation. arxiv:1707.00093 [cs.CY]. Retrieved from https:\/\/arxiv.org\/abs\/1707.00093"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/3511047.3538032","volume-title":"Adjunct Proceedings of the 30th ACM Conference on User Modeling, Adaptation and Personalization","author":"Burke Robin","year":"2022","unstructured":"Robin Burke, Nicholas Mattei, Vladislav Grozin, Amy Voida, and Nasim Sonboli. 2022. Multi-agent social choice for dynamic fairness-aware recommendation. In Adjunct Proceedings of the 30th ACM Conference on User Modeling, Adaptation and Personalization. ACM, New York, NY, 234\u2013244."},{"key":"e_1_3_3_13_2","first-page":"6","volume-title":"Proceedings of the KDD Workshop on Online and Adapting Recommender Systems (OARS\u201922)","author":"Burke Robin","year":"2022","unstructured":"Robin Burke, Pradeep Ragothaman, Nicholas Mattei, Brian Kimmig, Amy Voida, Nasim Sonboli, Anushka Kathait, and Melissa Fabros. 2022. A performance-preserving fairness intervention for adaptive microfinance recommendation. In Proceedings of the KDD Workshop on Online and Adapting Recommender Systems (OARS\u201922). KDD, 6 pages."},{"key":"e_1_3_3_14_2","series-title":"Proceedings of Machine Learning Research","first-page":"202","volume-title":"Proceedings of the 1st Conference on Fairness, Accountability and Transparency","volume":"81","author":"Burke Robin","year":"2018","unstructured":"Robin Burke, Nasim Sonboli, and Aldo Ordonez-Gauger. 2018. Balanced neighborhoods for multi-sided fairness in recommendation. In Proceedings of the 1st Conference on Fairness, Accountability and Transparency(Proceedings of Machine Learning Research, Vol. 81), Sorelle A. Friedler and Christo Wilson (Eds.). PMLR, New York, NY, 202\u2013214."},{"key":"e_1_3_3_15_2","first-page":"5","volume-title":"Harvard CRCS Workshop on AI for Social Good at 29th International Joint Conference on Artificial Intelligence (IJCAI\u201920)","author":"Burke Robin","year":"2020","unstructured":"Robin Burke, Amy Voida, Nicholas Mattei, and Nasim Sonboli. 2020. Algorithmic fairness, institutional logics, and social choice. In Harvard CRCS Workshop on AI for Social Good at 29th International Joint Conference on Artificial Intelligence (IJCAI\u201920). IJCAI, 5 pages."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/290941.291025","volume-title":"Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Carbonell Jaime","year":"1998","unstructured":"Jaime Carbonell and Jade Goldstein. 1998. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, NY, 335\u2013336."},{"issue":"3","key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","article-title":"How to use expert advice","volume":"44","author":"Cesa-Bianchi Nicolo","year":"1997","unstructured":"Nicolo Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth. 1997. How to use expert advice. J. ACM 44, 3 (1997), 427\u2013485.","journal-title":"J. ACM"},{"key":"e_1_3_3_18_2","first-page":"626","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"25","author":"Cohler Yuga","year":"2011","unstructured":"Yuga Cohler, John Lai, David Parkes, and Ariel Procaccia. 2011. Optimal envy-free cake cutting. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 25. AAAI, 626\u2013631."},{"issue":"1","key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s11257-023-09364-z","article-title":"Fairness in recommender systems: Research landscape and future directions","volume":"34","author":"Deldjoo Yashar","year":"2024","unstructured":"Yashar Deldjoo, Dietmar Jannach, Alejandro Bellogin, Alessandro Difonzo, and Dario Zanzonelli. 2024. Fairness in recommender systems: Research landscape and future directions. User Model. User-Adapt. Interact. 34, 1 (2024), 59\u2013108.","journal-title":"User Model. User-Adapt. Interact."},{"key":"e_1_3_3_20_2","first-page":"1007","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI\u201918)","author":"Dickerson John P.","year":"2018","unstructured":"John P. Dickerson, Karthik A Sankararaman, Aravind Srinivasan, and Pan Xu. 2018. Allocation problems in ride sharing platforms: Online matching with offline reusable resources. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI\u201918). AAAI, 1007\u20131014."},{"issue":"1","key":"e_1_3_3_21_2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1257\/aer.97.1.242","article-title":"Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords","volume":"97","author":"Edelman Benjamin","year":"2007","unstructured":"Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Am. Econ. Rev. 97, 1 (2007), 242\u2013259.","journal-title":"Am. Econ. Rev."},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"Michael D. Ekstrand Anubrata Das Robin Burke and Fernando Diaz. 2022. Fairness in information access systems. arxiv:2105.05779 [cs.IR]. Retrieved from https:\/\/arxiv.org\/abs\/2105.05779","DOI":"10.1561\/9781638280415"},{"key":"e_1_3_3_23_2","unstructured":"Paresha Farastu Nicholas Mattei and Robin Burke. 2022. Who pays? Personalization bossiness and the cost of fairness. arxiv:2209.04043 [cs.IR]. Retrieved from https:\/\/arxiv.org\/abs\/2209.04043"},{"key":"e_1_3_3_24_2","first-page":"249","volume-title":"Proceedings of the Conference on Human Information Interaction and Retrieval","author":"Ferraro Andres","year":"2021","unstructured":"Andres Ferraro, Xavier Serra, and Christine Bauer. 2021. Break the loop: Gender imbalance in music recommenders. In Proceedings of the Conference on Human Information Interaction and Retrieval. ACM, New York, NY, 249\u2013254."},{"key":"e_1_3_3_25_2","first-page":"4580","volume-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI\u201917)","author":"Freeman Rupert","year":"2017","unstructured":"Rupert Freeman, Seyed Majid Zahedi, and Vincent Conitzer. 2017. Fair social choice in dynamic settings. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI\u201917). International Joint Conferences on Artificial Intelligence, 4580\u20134587."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3433949"},{"key":"e_1_3_3_27_2","first-page":"445","volume-title":"Proceedings of the 14th ACM International Conference on Web Search and Data Mining","author":"Ge Yingqiang","year":"2021","unstructured":"Yingqiang Ge, Shuchang Liu, Ruoyuan Gao, Yikun Xian, Yunqi Li, Xiangyu Zhao, Changhua Pei, Fei Sun, Junfeng Ge, Wenwu Ou, et\u00a0al. 2021. Towards long-term fairness in recommendation. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. ACM, New York, NY, 445\u2013453."},{"issue":"4","key":"e_1_3_3_28_2","first-page":"19","article-title":"The MovieLens datasets: History and context","volume":"5","author":"Harper F. Maxwell","year":"2015","unstructured":"F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens datasets: History and context. ACM Trans. Interact. Intell. Syst. 5, 4 (2015), 19.","journal-title":"ACM Trans. Interact. Intell. Syst."},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/3287560.3287600","volume-title":"Proceedings of the Conference on Fairness, Accountability, and Transparency","author":"Hutchinson Ben","year":"2019","unstructured":"Ben Hutchinson and Margaret Mitchell. 2019. 50 years of test (un) fairness: Lessons for machine learning. In Proceedings of the Conference on Fairness, Accountability, and Transparency. ACM, New York, NY, 49\u201358."},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s11257-015-9165-3","article-title":"What recommenders recommend: An analysis of recommendation biases and possible countermeasures","volume":"25","author":"Jannach Dietmar","year":"2015","unstructured":"Dietmar Jannach, Lukas Lerche, Iman Kamehkhosh, and Michael Jugovac. 2015. What recommenders recommend: An analysis of recommendation biases and possible countermeasures. User Model. User-Adapt. Interact. 25 (2015), 427\u2013491.","journal-title":"User Model. User-Adapt. Interact."},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/3383313.3412232","volume-title":"Proceedings of the 14th ACM Conference on Recommender Systems","author":"Kaya Mesut","year":"2020","unstructured":"Mesut Kaya, Derek Bridge, and Nava Tintarev. 2020. Ensuring fairness in group recommendations by rank-sensitive balancing of relevance. In Proceedings of the 14th ACM Conference on Recommender Systems. ACM, New York, NY, 101\u2013110."},{"key":"e_1_3_3_32_2","unstructured":"Michael Kearns Seth Neel Aaron Roth and Zhiwei Steven Wu. 2018. Preventing fairness gerrymandering: Auditing and learning for subgroup fairness. arxiv:1711.05144 [cs.LG]. Retrieved from https:\/\/arxiv.org\/abs\/1711.05144"},{"key":"e_1_3_3_33_2","first-page":"1","article-title":"WeBuildAI: Participatory framework for algorithmic governance","volume":"3","author":"Lee Min Kyung","year":"2019","unstructured":"Min Kyung Lee, Daniel Kusbit, Anson Kahng, Ji Tae Kim, Xinran Yuan, Allissa Chan, Daniel See, Ritesh Noothigattu, Siheon Lee, and Alexandros Psomas. 2019. WeBuildAI: Participatory framework for algorithmic governance. Proc. ACM Hum.-Comput. Interact. 3, CSCW (2019), 1\u201335.","journal-title":"Proc. ACM Hum.-Comput. Interact."},{"issue":"1","key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3495163","article-title":"FairSR: Fairness-aware sequential recommendation through multi-task learning with preference graph embeddings","volume":"13","author":"Li Cheng-Te","year":"2022","unstructured":"Cheng-Te Li, Cheng Hsu, and Yang Zhang. 2022. FairSR: Fairness-aware sequential recommendation through multi-task learning with preference graph embeddings. ACM Trans. Intell. Syst. Technol. 13, 1 (2022), 1\u201321.","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"e_1_3_3_35_2","unstructured":"Weiwen Liu and Robin Burke. 2018. Personalizing fairness-aware re-ranking. arxiv:1809.02921 [cs.IR]. Retrieved from https:\/\/arxiv.org\/abs\/1809.02921."},{"key":"e_1_3_3_36_2","first-page":"24","volume-title":"Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC\u201918)","author":"Mattei N.","year":"2018","unstructured":"N. Mattei, A. Saffidine, and T. Walsh. 2018. An axiomatic and empirical analysis of mechanisms for online organ matching. In Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC\u201918). 24 pages."},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"3224","DOI":"10.1145\/3394486.3403374","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Mehrotra Rishabh","year":"2020","unstructured":"Rishabh Mehrotra, Niannan Xue, and Mounia Lalmas. 2020. Bandit based optimization of multiple objectives on a music streaming platform. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. KDD, 3224\u20133233."},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/3397271.3401100","volume-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Morik Marco","year":"2020","unstructured":"Marco Morik, Ashudeep Singh, Jessica Hong, and Thorsten Joachims. 2020. Controlling fairness and bias in dynamic learning-to-rank. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, NY, 429\u2013438."},{"key":"e_1_3_3_39_2","volume-title":"Fair Division and Collective Welfare","author":"Moulin Herv\u00e9","year":"2004","unstructured":"Herv\u00e9 Moulin. 2004. Fair Division and Collective Welfare. MIT Press."},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3359221","article-title":"This thing called fairness: Disciplinary confusion realizing a value in technology","volume":"3","author":"Mulligan Deirdre K","year":"2019","unstructured":"Deirdre K Mulligan, Joshua A. Kroll, Nitin Kohli, and Richmond Y. Wong. 2019. This thing called fairness: Disciplinary confusion realizing a value in technology. Proc. ACM Hum.-Comput. Interact. 3, CSCW (2019), 1\u201336.","journal-title":"Proc. ACM Hum.-Comput. Interact."},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","DOI":"10.18574\/nyu\/9781479833641.001.0001","volume-title":"Algorithms of Oppression: How Search Engines Reinforce Racism","author":"Noble Safiya Umoja","year":"2018","unstructured":"Safiya Umoja Noble. 2018. Algorithms of Oppression: How Search Engines Reinforce Racism. New York University Press."},{"key":"e_1_3_3_42_2","volume-title":"Weapons of Math Destruction: How Big Data Increases Inequality and Threatens Democracy","author":"O\u2019Neil Cathy","year":"2016","unstructured":"Cathy O\u2019Neil. 2016. Weapons of Math Destruction: How Big Data Increases Inequality and Threatens Democracy. Broadway Books."},{"key":"e_1_3_3_43_2","volume-title":"The Stanford Encyclopedia of Philosophy (Fall 2019 ed.)","author":"Pacuit Eric","year":"2019","unstructured":"Eric Pacuit. 2019. Voting methods. In The Stanford Encyclopedia of Philosophy (Fall 2019 ed.), Edward N. Zalta (Ed.). Metaphysics Research Lab, Stanford University."},{"issue":"6","key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1111\/1468-0262.00166","article-title":"Strategyproof assignment by hierarchical exchange","volume":"68","author":"P\u00e1pai Szilvia","year":"2000","unstructured":"Szilvia P\u00e1pai. 2000. Strategyproof assignment by hierarchical exchange. Econometrica 68, 6 (2000), 1403\u20131433.","journal-title":"Econometrica"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1145\/3366423.3380196","volume-title":"Proceedings of the Web Conference 2020","author":"Patro Gourab K.","year":"2020","unstructured":"Gourab K. Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi, and Abhijnan Chakraborty. 2020. FairRec: Two-sided fairness for personalized recommendations in two-sided platforms. In Proceedings of the Web Conference 2020. ACM, New York, NY, 1194\u20131204."},{"key":"e_1_3_3_46_2","first-page":"1929","volume-title":"Proceedings of the ACM Conference on Fairness, Accountability, and Transparency","author":"Patro Gourab K.","year":"2022","unstructured":"Gourab K. Patro, Lorenzo Porcaro, Laura Mitchell, Qiuyue Zhang, Meike Zehlike, and Nikhil Garg. 2022. Fair ranking: A critical review, challenges, and future directions. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. ACM, New York, NY, 1929\u20131942."},{"key":"e_1_3_3_47_2","first-page":"804","volume-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Perlich Claudia","year":"2012","unstructured":"Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, and Foster Provost. 2012. Bid optimizing and inventory scoring in targeted online advertising. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, 804\u2013812."},{"key":"e_1_3_3_48_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511811654","volume-title":"Multiagent Systems: Algorithmic, Game-theoretic, and Logical Foundations","author":"Shoham Yoav","year":"2008","unstructured":"Yoav Shoham and Kevin Leyton-Brown. 2008. Multiagent Systems: Algorithmic, Game-theoretic, and Logical Foundations. Cambridge University Press."},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"3648","DOI":"10.1145\/3543507.3583204","volume-title":"Proceedings of the ACM Web Conference 2023","author":"Smith Jessie J.","year":"2023","unstructured":"Jessie J. Smith, Lex Beattie, and Henriette Cramer. 2023. Scoping fairness objectives and identifying fairness metrics for recommender systems: The practitioners\u2019 perspective. In Proceedings of the ACM Web Conference 2023. ACM, New York, NY, USA, 3648\u20133659."},{"key":"e_1_3_3_50_2","first-page":"1652","volume-title":"Proceedings of the ACM Conference on Fairness, Accountability, and Transparency","author":"Smith Jessie J.","year":"2023","unstructured":"Jessie J. Smith, Anas Buhayh, Anushka Kathait, Pradeep Ragothaman, Nicholas Mattei, Robin Burke, and Amy Voida. 2023. The many faces of fairness: Exploring the institutional logics of multistakeholder microlending recommendation. In Proceedings of the ACM Conference on Fairness, Accountability, and Transparency. ACM, New York, NY, 1652\u20131663."},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.25810\/PGJK-RR19"},{"key":"e_1_3_3_52_2","unstructured":"Nasim Sonboli Robin Burke Nicholas Mattei Farzad Eskandanian and Tian Gao. 2020. \u201cAnd the winner is...\u201d: Dynamic lotteries for multi-group fairness-aware recommendation. arxiv:2009.02590 [cs.IR]. Retrieved from https:\/\/arxiv.org\/abs\/2009.02590"},{"key":"e_1_3_3_53_2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/3340631.3394846","volume-title":"Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization (UMAP\u201920)","author":"Sonboli Nasim","year":"2020","unstructured":"Nasim Sonboli, Farzad Eskandanian, Robin Burke, Weiwen Liu, and Bamshad Mobasher. 2020. Opportunistic multi-aspect fairness through personalized re-ranking. In Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization (UMAP\u201920). Association for Computing Machinery, New York, NY, 239\u2013247. 10.1145\/3340631.3394846"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","first-page":"3082","DOI":"10.1145\/3292500.3330793","volume-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"S\u00fchr Tom","year":"2019","unstructured":"Tom S\u00fchr, Asia J Biega, Meike Zehlike, Krishna P Gummadi, and Abhijnan Chakraborty. 2019. Two-sided fairness for repeated matchings in two-sided markets: A case study of a ride-hailing platform. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, New York, NY, 3082\u20133092."},{"key":"e_1_3_3_55_2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0169-7218(10)00021-3","volume-title":"Handbook of Social Choice and Welfare","author":"Thomson William","year":"2011","unstructured":"William Thomson. 2011. Fair allocation rules. In Handbook of Social Choice and Welfare. Vol. 2. Elsevier, 393\u2013506."},{"key":"e_1_3_3_56_2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF00433944","article-title":"Independence of clones as a criterion for voting rules","volume":"4","author":"Tideman T. Nicolaus","year":"1987","unstructured":"T. Nicolaus Tideman. 1987. Independence of clones as a criterion for voting rules. Social Choice and Welfare 4 (1987), 185\u2013206.","journal-title":"Social Choice and Welfare"},{"key":"e_1_3_3_57_2","doi-asserted-by":"crossref","unstructured":"Jun Wang Weinan Zhang and Shuai Yuan. 2017. Display advertising with real-time bidding (RTB) and behavioural targeting. arxiv:1610.03013 [cs.GT]. Retrieved from https:\/\/arxiv.orb\/abs\/1610.03013","DOI":"10.1561\/9781680833119"},{"issue":"3","key":"e_1_3_3_58_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3547333","article-title":"A survey on the fairness of recommender systems","volume":"41","author":"Wang Yifan","year":"2023","unstructured":"Yifan Wang, Weizhi Ma, Min Zhang, Yiqun Liu, and Shaoping Ma. 2023. A survey on the fairness of recommender systems. ACM Trans. Inf. Syst. 41, 3 (2023), 1\u201343.","journal-title":"ACM Trans. Inf. Syst."},{"issue":"2","key":"e_1_3_3_59_2","first-page":"1","article-title":"A multi-objective optimization framework for multi-stakeholder fairness-aware recommendation","volume":"41","author":"Wu Haolun","year":"2022","unstructured":"Haolun Wu, Chen Ma, Bhaskar Mitra, Fernando Diaz, and Xue Liu. 2022. A multi-objective optimization framework for multi-stakeholder fairness-aware recommendation. ACM Trans. Inf. Syst. 41, 2 (2022), 1\u201329.","journal-title":"ACM Trans. Inf. Syst."},{"issue":"1","key":"e_1_3_3_60_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3586993","article-title":"FASTER: A dynamic fairness-assurance strategy for session-based recommender systems","volume":"42","author":"Wu Yao","year":"2023","unstructured":"Yao Wu, Jian Cao, and Guandong Xu. 2023. FASTER: A dynamic fairness-assurance strategy for session-based recommender systems. ACM Trans. Inf. Syst. 42, 1 (2023), 1\u201326.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_3_61_2","unstructured":"Shuai Yuan Ahmad Zainal Abidin Marc Sloan and Jun Wang. 2012. Internet advertising: An interplay among advertisers online publishers ad exchanges and web users. arxiv:1206.1754 [cs.IR]. Retrieved from https:\/\/\/arxiv.org\/abs\/1206.1754"},{"key":"e_1_3_3_62_2","first-page":"3","volume-title":"Proceedings of the 7th International Workshop on Data Mining for Online Advertising","author":"Yuan Shuai","year":"2013","unstructured":"Shuai Yuan, Jun Wang, and Xiaoxue Zhao. 2013. Real-time bidding for online advertising: Measurement and analysis. In Proceedings of the 7th International Workshop on Data Mining for Online Advertising. ACM, New York, NY, 3."},{"issue":"1","key":"e_1_3_3_63_2","doi-asserted-by":"crossref","first-page":"102707","DOI":"10.1016\/j.ipm.2021.102707","article-title":"Fair top-k ranking with multiple protected groups","volume":"59","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Tom S\u00fchr, Ricardo Baeza-Yates, Francesco Bonchi, Carlos Castillo, and Sara Hajian. 2022. Fair top-k ranking with multiple protected groups. Inf. Process. Manage. 59, 1 (2022), 102707.","journal-title":"Inf. Process. Manage."},{"issue":"6","key":"e_1_3_3_64_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3533380","article-title":"Fairness in ranking, Part II: Learning-to-rank and recommender systems","volume":"55","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022. Fairness in ranking, Part II: Learning-to-rank and recommender systems. Comput. Surv. 55, 6 (2022), 1\u201341.","journal-title":"Comput. Surv."},{"key":"e_1_3_3_65_2","unstructured":"Dell Zhang and Jun Wang. 2021. Recommendation fairness: From static to dynamic. arxiv:2109.03150 [cs.IR]. Retrieved from https:\/\/arxiv.org\/abs\/2109.03150"},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1145\/2623330.2623633","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Zhang Weinan","year":"2014","unstructured":"Weinan Zhang, Shuai Yuan, and Jun Wang. 2014. Optimal real-time bidding for display advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, 1077\u20131086."},{"key":"e_1_3_3_67_2","first-page":"1153","volume-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management","author":"Zhu Ziwei","year":"2018","unstructured":"Ziwei Zhu, Xia Hu, and James Caverlee. 2018. Fairness-aware tensor-based recommendation. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ACM, New York, NY, 1153\u20131162."},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984.003"}],"container-title":["ACM Transactions on Recommender Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:06Z","timestamp":1750294686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3690653"],"URL":"https:\/\/doi.org\/10.1145\/3690653","relation":{},"ISSN":["2770-6699"],"issn-type":[{"value":"2770-6699","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"2023-03-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}