{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T14:03:06Z","timestamp":1770386586148,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T00:00:00Z","timestamp":1738800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T00:00:00Z","timestamp":1738800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Vingroup Innovation Foundation \u2013 VinIF","award":["VINIF.2022.DA00087"],"award-info":[{"award-number":["VINIF.2022.DA00087"]}]},{"name":"Vingroup Innovation Foundation \u2013 VinIF","award":["VINIF.2022.DA00087"],"award-info":[{"award-number":["VINIF.2022.DA00087"]}]},{"name":"Vingroup Innovation Foundation \u2013 VinIF","award":["VINIF.2022.DA00087"],"award-info":[{"award-number":["VINIF.2022.DA00087"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10994-024-06679-9","type":"journal-article","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T13:03:47Z","timestamp":1738847027000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards efficient pareto-optimal utility-fairness between groups in repeated rankings"],"prefix":"10.1007","volume":"114","author":[{"given":"Phuong Mai","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Duc-Trong","family":"Le","sequence":"additional","affiliation":[]},{"given":"Tuan-Anh","family":"Hoang","sequence":"additional","affiliation":[]},{"given":"Dung Duy","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,6]]},"reference":[{"key":"6679_CR1","unstructured":"Arfken, G.B., Weber, H.J., Harris, F.E.: Chapter 2. In: Arfken, G.B., Weber, H.J., Harris, F.E. (eds.) Mathematical Methods for Physicists (Third Edition), Third edition edn., pp. 102\u2013111. Academic Press, Orlando (1985). 10.1016\/B978-0-12-384654-9.00002-5 . https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780123846549000025"},{"key":"6679_CR2","doi-asserted-by":"crossref","unstructured":"Aysha, S., & Tarun, S. (2022). A pareto dominance approach to multi-criteria recommender system using pso algorithm. In A. Khanna, D. Gupta, S. Bhattacharyya, A. E. Hassanien, S. Anand, & A. Jaiswal (Eds.), International Conference on Innovative Computing and Communications (pp. 737\u2013755). Singapore: Springer.","DOI":"10.1007\/978-981-16-2594-7_60"},{"key":"6679_CR3","unstructured":"Biega, A.J., Diaz, F., Ekstrand, M.D., Feldman, S., Kohlmeier, S.: Overview of the TREC 2020 Fair Ranking Track (2021)"},{"key":"6679_CR4","doi-asserted-by":"crossref","unstructured":"Biega, A.J., Gummadi, K.P., Weikum, G.: Equity of attention. In: The 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, (2018). 10.1145\/3209978.3210063 .","DOI":"10.1145\/3209978.3210063"},{"issue":"4","key":"6679_CR5","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1137\/0122054","volume":"22","author":"VJ Bowman","year":"1972","unstructured":"Bowman, V. J. (1972). Permutation polyhedra. SIAM Journal on Applied Mathematics, 22(4), 580\u2013589. https:\/\/doi.org\/10.1137\/0122054","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"6679_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01449883","volume":"64","author":"C Carath\u00e9odory","year":"1907","unstructured":"Carath\u00e9odory, C. (1907). \u00dcber den variabilit\u00e4tsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen. Mathematische Annalen, 64, 95\u2013115.","journal-title":"Mathematische Annalen"},{"key":"6679_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00654ED1V01Y201507ICR043","volume-title":"Click models for web search","author":"A Chuklin","year":"2015","unstructured":"Chuklin, A., Markov, I., & Rijke, M. (2015). Click models for web search (pp. 1\u2013115). Cham: Springer Nature. https:\/\/doi.org\/10.2200\/S00654ED1V01Y201507ICR043"},{"key":"6679_CR8","doi-asserted-by":"publisher","DOI":"10.2200\/S00654ED1V01Y201507ICR043","volume-title":"Click Mmdels for web search","author":"A Chuklin","year":"2015","unstructured":"Chuklin, A., Markov, I., & Rijke, M. (2015). Click Mmdels for web search. Cham: Springer Nature. https:\/\/doi.org\/10.2200\/S00654ED1V01Y201507ICR043"},{"issue":"12","key":"6679_CR9","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1016\/j.laa.2010.01.024","volume":"432","author":"G Dahl","year":"2010","unstructured":"Dahl, G. (2010). Majorization permutahedra and (0,1)-matrices. Linear Algebra and its Applications, 432(12), 3265\u20133271. https:\/\/doi.org\/10.1016\/j.laa.2010.01.024","journal-title":"Linear Algebra and its Applications"},{"key":"6679_CR10","doi-asserted-by":"crossref","unstructured":"Diaz, F., Mitra, B., Ekstrand, M.D., Biega, A.J., Carterette, B.: Evaluating stochastic rankings with expected exposure. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management. CIKM \u201920, pp. 275\u2013284. ACM, (2020). 10.1145\/3340531.3411962 .","DOI":"10.1145\/3340531.3411962"},{"key":"6679_CR11","doi-asserted-by":"crossref","unstructured":"Dufoss\u00e9, F., U\u00e7ar, B.: Notes on birkhoff-von neumann decomposition of doubly stochastic matrices. Linear Algebra and its Applications 497, 108\u2013115 (2016), 10.1016\/j.laa.2016.02.023","DOI":"10.1016\/j.laa.2016.02.023"},{"key":"6679_CR12","doi-asserted-by":"crossref","unstructured":"Fu, Z., Xian, Y., Geng, S., Melo, G., Zhang, Y.: Popcorn: Human-in-the-loop popularity debiasing in conversational recommender systems. In: Proceedings of the 30th ACM International Conference on Information and Knowledge Management. CIKM \u201921, pp. 494\u2013503. Association for Computing Machinery, New York, NY, USA (2021). 10.1145\/3459637.3482461.","DOI":"10.1145\/3459637.3482461"},{"key":"6679_CR13","doi-asserted-by":"crossref","unstructured":"Ge, Y., Liu, S., Gao, R., Xian, Y., Li, Y., Zhao, X., Pei, C., Sun, F., Ge, J., Ou, W., Zhang, Y.: Towards long-term fairness in recommendation. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining. WSDM \u201921. ACM, (2021). 10.1145\/3437963.3441824 .","DOI":"10.1145\/3437963.3441824"},{"key":"6679_CR14","doi-asserted-by":"crossref","unstructured":"Ge, Y., Zhao, X., Yu, L., Paul, S., Hu, D., Hsieh, C.-C., Zhang, Y.: Toward pareto efficient fairness-utility trade-off in recommendation through reinforcement learning. In: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. WSDM \u201922. ACM, (2022). 10.1145\/3488560.3498487 .","DOI":"10.1145\/3488560.3498487"},{"key":"6679_CR15","doi-asserted-by":"crossref","unstructured":"Geyik, S.C., Ambler, S., Kenthapadi, K.: Fairness-aware ranking in search recommendation systems with application to LinkedIn talent search. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, (2019). 10.1145\/3292500.3330691.","DOI":"10.1145\/3292500.3330691"},{"issue":"1","key":"6679_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.21099\/tkbjm\/1496162466","volume":"18","author":"T Gotoh","year":"1994","unstructured":"Gotoh, T. (1994). Geodesic hyperspheres in complex projective space. Tsukuba Journal of Mathematics, 18(1), 207\u2013215.","journal-title":"Tsukuba Journal of Mathematics"},{"key":"6679_CR17","doi-asserted-by":"crossref","unstructured":"Hilton, P.J.: Topology. by john g. hocking and gail s. young. pp. 382. 74s. 1961. (addison-wesley). The Mathematical Gazette 48(363), 122\u2013123 (1964) 10.2307\/3614368","DOI":"10.2307\/3614368"},{"key":"6679_CR18","doi-asserted-by":"crossref","unstructured":"Horen, J.: Linear programming, by Katta, G., Murty, Jo., (eds), Wiley, New York, 1983, 482 pp. Networks 15(2), 273\u2013274 (1985)","DOI":"10.1002\/net.3230150211"},{"issue":"2","key":"6679_CR19","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0377-2217(02)00061-9","volume":"140","author":"T Ill\u00e9s","year":"2002","unstructured":"Ill\u00e9s, T., & Terlaky, T. (2002). Pivot versus interior point methods: Pros and cons. European Journal of Operational Research, 140(2), 170\u2013190. https:\/\/doi.org\/10.1016\/S0377-2217(02)00061-9","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6679_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of ir techniques. ACM Transactions on Information Systems, 20(4), 422\u2013446. https:\/\/doi.org\/10.1145\/582415.582418","journal-title":"ACM Transactions on Information Systems"},{"key":"6679_CR21","unstructured":"Jin, J., Zhang, Z., Li, Z., Gao, X., Yang, X., Xiao, L., Jiang, J.: Pareto-based multi-objective recommender system with forgetting curve. ArXiv abs\/2312.16868 (2023)"},{"key":"6679_CR22","unstructured":"Karimi, S., Rahmani, H.A., Naghiaei, M., Safari, L.: Provider fairness and beyond-accuracy trade-offs in recommender systems (2023)"},{"key":"6679_CR23","doi-asserted-by":"crossref","unstructured":"Kletti, T., Renders, J.-M., Loiseau, P.: Introducing the expohedron for efficient pareto-optimal fairness-utility amortizations in repeated rankings. In: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. ACM, (2022). 10.1145\/3488560.3498490 .","DOI":"10.1145\/3488560.3498490"},{"key":"6679_CR24","unstructured":"Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of majorization and its applications. (1980). https:\/\/api.semanticscholar.org\/CorpusID:37387169"},{"key":"6679_CR25","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952","author":"A Moffat","year":"2008","unstructured":"Moffat, A., & Zobel, J. (2008). Rank-biased precision for measurement of retrieval effectiveness. ACM Transactions on Information Systems. https:\/\/doi.org\/10.1145\/1416950.1416952","journal-title":"ACM Transactions on Information Systems"},{"issue":"1","key":"6679_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y. E., & Todd, M. J. (1997). Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22(1), 1\u201342. https:\/\/doi.org\/10.1287\/moor.22.1.1","journal-title":"Mathematics of Operations Research"},{"key":"6679_CR27","doi-asserted-by":"crossref","unstructured":"Paparella, V.: Pursuing optimal trade-off solutions in multi-objective recommender systems. Proceedings of the 16th ACM Conference on Recommender Systems (2022)","DOI":"10.1145\/3523227.3547425"},{"key":"6679_CR28","unstructured":"Pareto, V.: Manual of Political Economy: A Critical and Variorum Edition. OUP Catalogue, vol. 9780199607952. Oxford University Press, (2014). https:\/\/ideas.repec.org\/b\/oxp\/obooks\/9780199607952.html"},{"key":"6679_CR29","unstructured":"Qin, T., Liu, T.: Introducing LETOR 4.0 datasets. CoRR abs\/1306.2597 (2013)"},{"key":"6679_CR30","doi-asserted-by":"crossref","unstructured":"Seymen, S., Abdollahpouri, H., Malthouse, E.C.: A unified optimization toolbox for solving popularity bias, fairness, and diversity in recommender systems. In: Abdollahpouri, H., Elahi, M., Mansoury, M., Sahebi, S., Nazari, Z., Chaney, A., Loni, B. (eds.) Proceedings of the 1st Workshop on Multi-Objective Recommender Systems (MORS 2021) Co-located with 15th ACM Conference on Recommender Systems (RecSys 2021), Amsterdam, The Netherlands, September 25, 2021. CEUR Workshop Proceedings, vol. 2959. CEUR-WS.org, (2021). http:\/\/ceur-ws.org\/Vol-2959\/paper5.pdf","DOI":"10.1145\/3460231.3470936"},{"key":"6679_CR31","doi-asserted-by":"crossref","unstructured":"Singh, A., Joachims, T.: Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, (2018). 10.1145\/3219819.3220088 .","DOI":"10.1145\/3219819.3220088"},{"key":"6679_CR32","unstructured":"Snyder, J.P.: Map projections: A working manual. (2012). https:\/\/api.semanticscholar.org\/CorpusID:60447053"},{"key":"6679_CR33","doi-asserted-by":"crossref","unstructured":"Su, Y., Bayoumi, M., Joachims, T.: Optimizing Rankings for Recommendation in Matching Markets (2021)","DOI":"10.1145\/3485447.3511961"},{"key":"6679_CR34","doi-asserted-by":"crossref","unstructured":"Thonet, T., Renders, J.-M.: Multi-grouping robust fair ranking. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. SIGIR \u201920, pp. 2077\u20132080. Association for Computing Machinery, New York, NY, USA (2020). 10.1145\/3397271.3401292 .","DOI":"10.1145\/3397271.3401292"},{"key":"6679_CR35","doi-asserted-by":"crossref","unstructured":"Wang, L., Joachims, T.: User fairness, item fairness, and diversity for rankings in two-sided markets. In: Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval. ICTIR \u201921. ACM, (2021). 10.1145\/3471158.3472260 .","DOI":"10.1145\/3471158.3472260"},{"key":"6679_CR36","doi-asserted-by":"crossref","unstructured":"Wang, R., Shivanna, R., Cheng, D.Z., Jain, S., Lin, D., Hong, L., Chi, E.H.: Dcn v2: Improved deep and cross network and practical lessons for web-scale learning to rank systems. Proceedings of the Web Conference 2021 (2020)","DOI":"10.1145\/3442381.3450078"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06679-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T01:01:58Z","timestamp":1770339718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06679-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,6]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["6679"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06679-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,6]]},"assertion":[{"value":"30 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"56"}}