{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:33:24Z","timestamp":1774308804901,"version":"3.50.1"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2023YFA1008704"],"award-info":[{"award-number":["2023YFA1008704"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62376275, 62106273, 72192805"],"award-info":[{"award-number":["62376275, 62106273, 72192805"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2025,1,31]]},"abstract":"<jats:p>Multi-stakeholder recommender systems involve various roles, such as users and providers. Previous work pointed out that max-min fairness (MMF) is a better metric to support weak providers. However, when considering MMF, the features or parameters of these roles vary over time, and how to ensure long-term provider MMF has become a significant challenge. We observed that recommendation feedback loops (RFL) will influence the provider MMF greatly in the long term. RFL means that recommender systems can only receive feedback on exposed items from users and update recommender models incrementally based on this feedback. When utilizing the feedback, the recommender model will regard the unexposed items as negative. In this way, the tail provider will not get the opportunity to be exposed, and its items will always be considered negative samples. Such phenomena will become more and more serious in RFL. To alleviate the problem, this article proposes an online ranking model named Long-Term Provider Max-min Fairness (LTP-MMF). Theoretical analysis shows that the long-term regret of LTP-MMF enjoys a sub-linear bound. Experimental results on three public recommendation benchmarks demonstrated that LTP-MMF can outperform the baselines in the long term.<\/jats:p>","DOI":"10.1145\/3695867","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T14:22:10Z","timestamp":1726237330000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["LTP-MMF: Toward Long-Term Provider Max-Min Fairness under Recommendation Feedback Loops"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3070-9358","authenticated-orcid":false,"given":"Chen","family":"Xu","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1896-0309","authenticated-orcid":false,"given":"Xiaopeng","family":"Ye","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-111X","authenticated-orcid":false,"given":"Jun","family":"Xu","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7397-5632","authenticated-orcid":false,"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4366-9276","authenticated-orcid":false,"given":"Weiran","family":"Shen","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-9676","authenticated-orcid":false,"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/2986459.2986717"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-019-09256-1"},{"key":"e_1_3_2_4_2","unstructured":"Himan Abdollahpouri and Robin Burke. 2019. Multi-stakeholder recommendation and its connection to multi-sided fairness. arXiv:1907.13158. Retrieved from https:\/\/arxiv.org\/abs\/1907.13158"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Nil-Jana Akpinar Cyrus DiCiccio Preetam Nandy and Kinjal Basu. 2022. Long-term dynamics of fairness intervention in connection recommender systems. arXiv:2203.16432. Retrieved from https:\/\/arxiv.org\/abs\/2203.16432","DOI":"10.1145\/3514094.3534173"},{"key":"e_1_3_2_6_2","first-page":"630","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Balseiro Santiago","year":"2021","unstructured":"Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2021. Regularized online allocation problems: Fairness and beyond. In Proceedings of the International Conference on Machine Learning. PMLR, 630\u2013639."},{"key":"e_1_3_2_7_2","unstructured":"Santiago R. Balseiro Haihao Lu Vahab Mirrokni and Balasubramanian Sivan. 2022. From online optimization to PID controllers: Mirror descent with momentum. arXiv:2202.06152. Retrieved from https:\/\/arxiv.org\/abs\/2202.06152"},{"key":"e_1_3_2_8_2","first-page":"3456","volume-title":"Proceedings of the ACM Web Conference","author":"Ben-Porat Omer","year":"2023","unstructured":"Omer Ben-Porat and Rotem Torkan. 2023. Learning with exposure constraints in recommendation systems. In Proceedings of the ACM Web Conference, 3456\u20133466."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0865"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_11_2","first-page":"930","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Bistritz Ilai","year":"2020","unstructured":"Ilai Bistritz, Tavor Baharav, Amir Leshem, and Nicholas Bambos. 2020. My fair bandit: Distributed learning of max-min fairness with multi-player bandits. In Proceedings of the International Conference on Machine Learning. PMLR, 930\u2013940."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455305"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503624"},{"key":"e_1_3_2_14_2","first-page":"202","volume-title":"Proceedings of the Conference on Fairness, Accountability and Transparency","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 Conference on Fairness, Accountability and Transparency. PMLR, 202\u2013214."},{"key":"e_1_3_2_15_2","unstructured":"Jiawei Chen Hande Dong Xiang Wang Fuli Feng Meng Wang and Xiangnan He. 2020. Bias and debias in recommender system: A survey and future directions. arXiv:2010.03240. Retrieved from https:\/\/arxiv.org\/abs\/2010.03240"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Yashar Deldjoo. 2024. Understanding biases in ChatGPT-based recommender systems: Provider fairness temporal stability and recency. arXiv:2401.10545.","DOI":"10.1145\/3690655"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013445"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565472.3592960"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/3540261.3540919"},{"key":"e_1_3_2_21_2","unstructured":"KJ Erickson. 2018. In Their Own Words: Why Sellers Are Fed Up With Amazon. Retrieved from https:\/\/medium.com\/public-market\/in-their-own-words-why-sellers-are-fed-up-with-amazon-e97da44f7f18"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406522.3446033"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441824"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102719"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3570725"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959167"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290958"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00035"},{"key":"e_1_3_2_30_2","unstructured":"Saeedeh Karimi Hossein A. Rahmani Mohammadmehdi Naghiaei and Leila Safari. 2023. Provider fairness and beyond-accuracy trade-offs in recommender systems. arXiv:2309.04250. Retrieved from https:\/\/arxiv.org\/abs\/2309.04250"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_32_2","volume-title":"The Stanford Encyclopedia of Philosophy","author":"Lamont Julian","year":"2017","unstructured":"Julian Lamont and Christi Favor. 2017. Distributive Justice. In The Stanford Encyclopedia of Philosophy (Winter 2017 ed.). Edward N. Zalta (Ed.), Metaphysics Research Lab, Stanford University."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3533725"},{"key":"e_1_3_2_35_2","unstructured":"Xinyi Li Yongfeng Zhang and Edward C. Malthouse. 2023. A preliminary study of chatgpt on news recommendation: Personalization provider fairness fake news. arXiv:2306.10702. Retrieved from https:\/\/arxiv.org\/abs\/2306.10702"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401083"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3_9"},{"key":"e_1_3_2_38_2","unstructured":"Debmalya Mandal and Jiarui Gan. 2022. Socially fair reinforcement learning. arXiv:2208.12584. Retrieved from https:\/\/arxiv.org\/abs\/2208.12584"},{"key":"e_1_3_2_39_2","first-page":"6987","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Mladenov Martin","year":"2020","unstructured":"Martin Mladenov, Elliot Creager, Omer Ben-Porat, Kevin Swersky, Richard Zemel, and Craig Boutilier. 2020. Optimizing long-term social welfare in recommender systems: A constrained matching approach. In Proceedings of the International Conference on Machine Learning. PMLR, 6987\u20136998."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","unstructured":"Mohammadmehdi Naghiaei Hossein A Rahmani and Yashar Deldjoo. 2022. Cpfair: Personalized consumer and producer fairness re-ranking for recommender systems. arXiv:2204.08085. Retrieved from https:\/\/arxiv.org\/abs\/2204.08085","DOI":"10.1145\/3477495.3531959"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_2_43_2","volume-title":"Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS \u201917)","author":"Paszke Adam","year":"2017","unstructured":"Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in PyTorch. In Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS \u201917)."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380196"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532046"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"key":"e_1_3_2_47_2","unstructured":"Steffen Rendle Christoph Freudenthaler Zeno Gantner and Lars Schmidt-Thieme. 2012. BPR: Bayesian personalized ranking from implicit feedback. arXiv:1205.2618."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17849-8_21"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_50_2","first-page":"645","volume-title":"Companion Proceedings of the World Wide Web Conference","author":"Sun Wenlong","year":"2019","unstructured":"Wenlong Sun, Sami Khenissi, Olfa Nasraoui, and Patrick Shafto. 2019. Debiasing the human-recommender system feedback loop in collaborative filtering. In Companion Proceedings of the World Wide Web Conference, 645\u2013651."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294996.3295121"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988452"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983847"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10936"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00074"},{"key":"e_1_3_2_56_2","first-page":"357","volume-title":"Proceedings of the ACM on Conference on Information and Knowledge Management","author":"Wang Xin","year":"2017","unstructured":"Xin Wang, Steven CH Hoi, Chenghao Liu, and Martin Ester. 2017. Interactive social recommendation. In Proceedings of the ACM on Conference on Information and Knowledge Management, 357\u2013366."},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462882"},{"key":"e_1_3_2_59_2","first-page":"3701","volume-title":"Proceedings of the ACM Web Conference","author":"Xu Chen","year":"2023","unstructured":"Chen Xu, Sirui Chen, Jun Xu, Weiran Shen, Xiao Zhang, Gang Wang, and Zhenhua Dong. 2023. P-MMF: Provider Max-min Fairness re-ranking in recommender system. In Proceedings of the ACM Web Conference, 3701\u20133711."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557299"},{"key":"e_1_3_2_61_2","unstructured":"Chen Xu Jun Xu Yiming Ding Xiao Zhang and Qi Qi. 2024. FairSync: Ensuring amortized group exposure in distributed recommendation retrieval. arXiv:2402.10628. Retrieved from https:\/\/arxiv.org\/abs\/2402.10628"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401321"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240374"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695867","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:29Z","timestamp":1750291469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,31]]}},"alternative-id":["10.1145\/3695867"],"URL":"https:\/\/doi.org\/10.1145\/3695867","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"2023-08-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}