{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T09:48:28Z","timestamp":1784886508008,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":84,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3532035","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:08Z","timestamp":1657206728000},"page":"737-747","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Optimizing Generalized Gini Indices for Fairness in Rankings"],"prefix":"10.1145","author":[{"given":"Virginie","family":"Do","sequence":"first","affiliation":[{"name":"Meta AI Research & Universit\u00e9 Paris Dauphine-PSL, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Usunier","sequence":"additional","affiliation":[{"name":"Meta AI Research, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-019-09256-1"},{"key":"e_1_3_2_2_2_1","volume-title":"The unfairness of popularity bias in recommendation. arXiv preprint arXiv:1907.13286","author":"Abdollahpouri Himan","year":"2019","unstructured":"Himan Abdollahpouri , Masoud Mansoury , Robin Burke , and Bamshad Mobasher . 2019. The unfairness of popularity bias in recommendation. arXiv preprint arXiv:1907.13286 ( 2019 ). Himan Abdollahpouri, Masoud Mansoury, Robin Burke, and Bamshad Mobasher. 2019. The unfairness of popularity bias in recommendation. arXiv preprint arXiv:1907.13286 (2019)."},{"key":"e_1_3_2_2_3_1","volume-title":"Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925","author":"Adams Ryan Prescott","year":"2011","unstructured":"Ryan Prescott Adams and Richard S Zemel . 2011. Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925 ( 2011 ). Ryan Prescott Adams and Richard S Zemel. 2011. Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925 (2011)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(70)90039-6"},{"key":"e_1_3_2_2_5_1","volume-title":"A Framework for Fairness in Two-Sided Marketplaces. arXiv preprint arXiv:2006.12756","author":"Basu Kinjal","year":"2020","unstructured":"Kinjal Basu , Cyrus DiCiccio , Heloise Logan , and Noureddine El Karoui . 2020. A Framework for Fairness in Two-Sided Marketplaces. arXiv preprint arXiv:2006.12756 ( 2020 ). Kinjal Basu, Cyrus DiCiccio, Heloise Logan, and Noureddine El Karoui. 2020. A Framework for Fairness in Two-Sided Marketplaces. arXiv preprint arXiv:2006.12756 (2020)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/100818327"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497314970"},{"key":"e_1_3_2_2_8_1","volume-title":"The 41st international acm sigir conference on research & development in information retrieval. 405--414.","author":"Biega Asia J","unstructured":"Asia J Biega , Krishna P Gummadi , and Gerhard Weikum . 2018. Equity of attention: Amortizing individual fairness in rankings . In The 41st international acm sigir conference on research & development in information retrieval. 405--414. Asia J Biega, Krishna P Gummadi, and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In The 41st international acm sigir conference on research & development in information retrieval. 405--414."},{"key":"e_1_3_2_2_9_1","volume-title":"Lattice theory","author":"Birkhoff Garrett","unstructured":"Garrett Birkhoff . 1940. Lattice theory . Vol. 25 . American Mathematical Soc . Garrett Birkhoff. 1940. Lattice theory. Vol. 25. American Mathematical Soc."},{"key":"e_1_3_2_2_10_1","volume-title":"International Conference on Machine Learning. PMLR, 950--959","author":"Blondel Mathieu","year":"2020","unstructured":"Mathieu Blondel , Olivier Teboul , Quentin Berthet , and Josip Djolonga . 2020 . Fast differentiable sorting and ranking . In International Conference on Machine Learning. PMLR, 950--959 . Mathieu Blondel, Olivier Teboul, Quentin Berthet, and Josip Djolonga. 2020. Fast differentiable sorting and ranking. In International Conference on Machine Learning. PMLR, 950--959."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567766"},{"key":"e_1_3_2_2_12_1","volume-title":"Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093","author":"Burke Robin","year":"2017","unstructured":"Robin Burke . 2017. Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093 ( 2017 ). Robin Burke. 2017. Multisided fairness for recommendation. arXiv preprint arXiv:1707.00093 (2017)."},{"key":"e_1_3_2_2_13_1","volume-title":"International Conference on Machine Learning. PMLR, 625--634","author":"Busa-Fekete R\u00f3bert","year":"2017","unstructured":"R\u00f3bert Busa-Fekete , Bal\u00e1zs Sz\u00f6r\u00e9nyi , Paul Weng , and Shie Mannor . 2017 . Multiobjective bandits: Optimizing the generalized Gini index . In International Conference on Machine Learning. PMLR, 625--634 . R\u00f3bert Busa-Fekete, Bal\u00e1zs Sz\u00f6r\u00e9nyi, Paul Weng, and Shie Mannor. 2017. Multiobjective bandits: Optimizing the generalized Gini index. In International Conference on Machine Learning. PMLR, 625--634."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2044016"},{"key":"e_1_3_2_2_15_1","volume-title":"Gradient descent optimization of smoothed information retrieval metrics. Information retrieval 13, 3","author":"Chapelle Olivier","year":"2010","unstructured":"Olivier Chapelle and Mingrui Wu. 2010. Gradient descent optimization of smoothed information retrieval metrics. Information retrieval 13, 3 ( 2010 ), 216-- 235. Olivier Chapelle and Mingrui Wu. 2010. Gradient descent optimization of smoothed information retrieval metrics. Information retrieval 13, 3 (2010), 216-- 235."},{"key":"e_1_3_2_2_16_1","volume-title":"Smoothing proximal gradient method for general structured sparse learning. arXiv preprint arXiv:1202.3708","author":"Chen Xi","year":"2012","unstructured":"Xi Chen , Qihang Lin , Seyoung Kim , Jaime G Carbonell , and Eric P Xing . 2012. Smoothing proximal gradient method for general structured sparse learning. arXiv preprint arXiv:1202.3708 ( 2012 ). Xi Chen, Qihang Lin, Seyoung Kim, Jaime G Carbonell, and Eric P Xing. 2012. Smoothing proximal gradient method for general structured sparse learning. arXiv preprint arXiv:1202.3708 (2012)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824783"},{"key":"e_1_3_2_2_18_1","volume-title":"An axiomatic theory of provably-fair welfare-centric machine learning. Advances in Neural Information Processing Systems 34","author":"Cousins Cyrus","year":"2021","unstructured":"Cyrus Cousins . 2021. An axiomatic theory of provably-fair welfare-centric machine learning. Advances in Neural Information Processing Systems 34 ( 2021 ). Cyrus Cousins. 2021. An axiomatic theory of provably-fair welfare-centric machine learning. Advances in Neural Information Processing Systems 34 (2021)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8586.1988.tb00274.x"},{"key":"e_1_3_2_2_20_1","volume-title":"Measurement of inequality. Handbook of income distribution 1","author":"Cowell Frank A","year":"2000","unstructured":"Frank A Cowell . 2000. Measurement of inequality. Handbook of income distribution 1 ( 2000 ), 87--166. Frank A Cowell. 2000. Measurement of inequality. Handbook of income distribution 1 (2000), 87--166."},{"key":"e_1_3_2_2_21_1","unstructured":"Marco Cuturi Olivier Teboul and Jean-Philippe Vert. 2019. Differentiable Ranking and Sorting using Optimal Transport. In Advances in Neural Information Processing Systems. 6858--6868.  Marco Cuturi Olivier Teboul and Jean-Philippe Vert. 2019. Differentiable Ranking and Sorting using Optimal Transport. In Advances in Neural Information Processing Systems. 6858--6868."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2223525"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0007"},{"key":"e_1_3_2_2_24_1","volume-title":"The anatomy of a scientific rumor. Scientific reports 3, 1","author":"Domenico Manlio De","year":"2013","unstructured":"Manlio De Domenico , Antonio Lima , Paul Mougel , and Mirco Musolesi . 2013. The anatomy of a scientific rumor. Scientific reports 3, 1 ( 2013 ), 1--9. Manlio De Domenico, Antonio Lima, Paul Mougel, and Mirco Musolesi. 2013. The anatomy of a scientific rumor. Scientific reports 3, 1 (2013), 1--9."},{"key":"e_1_3_2_2_25_1","volume-title":"Hamed Zamani, Alejandro Bellogin, and Tommaso Di Noia.","author":"Deldjoo Yashar","year":"2021","unstructured":"Yashar Deldjoo , Vito Walter Anelli , Hamed Zamani, Alejandro Bellogin, and Tommaso Di Noia. 2021 . A flexible framework for evaluating user and item fairness in recommender systems. User Modeling and User-Adapted Interaction ( 2021), 1--55. Yashar Deldjoo, Vito Walter Anelli, Hamed Zamani, Alejandro Bellogin, and Tommaso Di Noia. 2021. A flexible framework for evaluating user and item fairness in recommender systems. User Modeling and User-Adapted Interaction (2021), 1--55."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_2_27_1","volume-title":"Twosided fairness in rankings via Lorenz dominance. Advances in Neural Information Processing Systems 34","author":"Do Virginie","year":"2021","unstructured":"Virginie Do , Sam Corbett-Davies , Jamal Atif , and Nicolas Usunier . 2021. Twosided fairness in rankings via Lorenz dominance. Advances in Neural Information Processing Systems 34 ( 2021 ). Virginie Do, Sam Corbett-Davies, Jamal Atif, and Nicolas Usunier. 2021. Twosided fairness in rankings via Lorenz dominance. Advances in Neural Information Processing Systems 34 (2021)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20606"},{"key":"e_1_3_2_2_29_1","volume-title":"Conference on Fairness, Accountability and Transparency. PMLR, 172--186","author":"Ekstrand Michael D","year":"2018","unstructured":"Michael D Ekstrand , Mucun Tian , Ion Madrazo Azpiazu , Jennifer D Ekstrand , Oghenemaro Anuyah , David McNeill , and Maria Soledad Pera . 2018 . 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. PMLR, 172--186 . Michael D Ekstrand, Mucun Tian, Ion Madrazo Azpiazu, Jennifer D Ekstrand, Oghenemaro Anuyah, David McNeill, and Maria Soledad Pera. 2018. 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. PMLR, 172--186."},{"key":"e_1_3_2_2_30_1","volume-title":"Bridging Machine Learning and Mechanism Design towards Algorithmic Fairness. arXiv preprint arXiv:2010.05434","author":"Finocchiaro Jessie","year":"2020","unstructured":"Jessie Finocchiaro , Roland Maio , Faidra Monachou , Gourab K Patro , Manish Raghavan , Ana-Andreea Stoica , and Stratis Tsirtsis . 2020. Bridging Machine Learning and Mechanism Design towards Algorithmic Fairness. arXiv preprint arXiv:2010.05434 ( 2020 ). Jessie Finocchiaro, Roland Maio, Faidra Monachou, Gourab K Patro, Manish Raghavan, Ana-Andreea Stoica, and Stratis Tsirtsis. 2020. Bridging Machine Learning and Mechanism Design towards Algorithmic Fairness. arXiv preprint arXiv:2010.05434 (2020)."},{"key":"e_1_3_2_2_31_1","volume-title":"An algorithm for quadratic programming. Naval research logistics quarterly 3, 1--2","author":"Frank Marguerite","year":"1956","unstructured":"Marguerite Frank and Philip Wolfe . 1956. An algorithm for quadratic programming. Naval research logistics quarterly 3, 1--2 ( 1956 ), 95--110. Marguerite Frank and Philip Wolfe. 1956. An algorithm for quadratic programming. Naval research logistics quarterly 3, 1--2 (1956), 95--110."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(68)90201-1"},{"key":"e_1_3_2_2_33_1","volume-title":"Measurement of inequality of incomes. The economic journal 31, 121","author":"Gini Corrado","year":"1921","unstructured":"Corrado Gini . 1921. Measurement of inequality of incomes. The economic journal 31, 121 ( 1921 ), 124--126. Corrado Gini. 1921. Measurement of inequality of incomes. The economic journal 31, 121 (1921), 124--126."},{"key":"e_1_3_2_2_34_1","volume-title":"Paradoxes in Fair Machine Learning. Advances in Neural Information Processing Systems (NeurIPS). Forthcoming","author":"G\u00f6lz Paul","year":"2019","unstructured":"Paul G\u00f6lz , Anson Kahng , and Ariel D Procaccia . 2019. Paradoxes in Fair Machine Learning. Advances in Neural Information Processing Systems (NeurIPS). Forthcoming ( 2019 ). Paul G\u00f6lz, Anson Kahng, and Ariel D Procaccia. 2019. Paradoxes in Fair Machine Learning. Advances in Neural Information Processing Systems (NeurIPS). Forthcoming (2019)."},{"key":"e_1_3_2_2_35_1","volume-title":"Stochastic optimization of sorting networks via continuous relaxations. arXiv preprint arXiv:1903.08850","author":"Grover Aditya","year":"2019","unstructured":"Aditya Grover , Eric Wang , Aaron Zweig , and Stefano Ermon . 2019. Stochastic optimization of sorting networks via continuous relaxations. arXiv preprint arXiv:1903.08850 ( 2019 ). Aditya Grover, Eric Wang, Aaron Zweig, and Stefano Ermon. 2019. Stochastic optimization of sorting networks via continuous relaxations. arXiv preprint arXiv:1903.08850 (2019)."},{"key":"e_1_3_2_2_36_1","volume-title":"Inequalities","author":"Hardy G. H.","year":"1952","unstructured":"G. H. Hardy , J. E. Littlewood , and George P\u00f3lya . 1952. Inequalities . 2 nd ed. Cambridge, Engl .: At the University Press . XII, 324 p. ( 1952 ).. G. H. Hardy, J. E. Littlewood, and George P\u00f3lya. 1952. Inequalities. 2nd ed. Cambridge, Engl.: At the University Press. XII, 324 p. (1952)..","edition":"2"},{"key":"e_1_3_2_2_37_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4","author":"Maxwell Harper F","year":"2015","unstructured":"F Maxwell Harper and Joseph A Konstan . 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4 ( 2015 ), 1--19. F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4 (2015), 1--19."},{"key":"e_1_3_2_2_38_1","unstructured":"Hoda Heidari Claudio Ferrari Krishna Gummadi and Andreas Krause. 2018. Fairness behind a veil of ignorance: A welfare analysis for automated decision making. In Advances in Neural Information Processing Systems. 1265--1276.  Hoda Heidari Claudio Ferrari Krishna Gummadi and Andreas Krause. 2018. Fairness behind a veil of ignorance: A welfare analysis for automated decision making. In Advances in Neural Information Processing Systems. 1265--1276."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372857"},{"key":"e_1_3_2_2_40_1","volume-title":"International Conference on Machine Learning. PMLR, 427--435","author":"Jaggi Martin","year":"2013","unstructured":"Martin Jaggi . 2013 . Revisiting Frank-Wolfe: Projection-free sparse convex optimization . In International Conference on Machine Learning. PMLR, 427--435 . Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In International Conference on Machine Learning. PMLR, 427--435."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186109"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467298"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498490"},{"key":"e_1_3_2_2_44_1","volume-title":"The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arXiv:1309.5550","author":"Lan Guanghui","year":"2013","unstructured":"Guanghui Lan . 2013. The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arXiv:1309.5550 ( 2013 ). Guanghui Lan. 2013. The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arXiv:1309.5550 (2013)."},{"key":"e_1_3_2_2_45_1","volume-title":"Measuring Disparate Outcomes of Content Recommendation Algorithms with Distributional Inequality Metrics. arXiv preprint arXiv:2202.01615","author":"Lazovich Tomo","year":"2022","unstructured":"Tomo Lazovich , Luca Belli , Aaron Gonzales , Amanda Bower , Uthaipon Tantipongpipat , Kristian Lum , Ferenc Huszar , and Rumman Chowdhury . 2022. Measuring Disparate Outcomes of Content Recommendation Algorithms with Distributional Inequality Metrics. arXiv preprint arXiv:2202.01615 ( 2022 ). Tomo Lazovich, Luca Belli, Aaron Gonzales, Amanda Bower, Uthaipon Tantipongpipat, Kristian Lum, Ferenc Huszar, and Rumman Chowdhury. 2022. Measuring Disparate Outcomes of Content Recommendation Algorithms with Distributional Inequality Metrics. arXiv preprint arXiv:2202.01615 (2022)."},{"key":"e_1_3_2_2_46_1","unstructured":"Cong Han Lim and Stephen J Wright. 2016. Efficient bregman projections onto the permutahedron and related polytopes. In Artificial Intelligence and Statistics. PMLR 1205--1213.  Cong Han Lim and Stephen J Wright. 2016. Efficient bregman projections onto the permutahedron and related polytopes. In Artificial Intelligence and Statistics. PMLR 1205--1213."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054197"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403374"},{"key":"e_1_3_2_2_49_1","volume-title":"Nonlinear multiobjective optimization","author":"Miettinen Kaisa","unstructured":"Kaisa Miettinen . 2012. Nonlinear multiobjective optimization . Vol. 12 . Springer Science & Business Media . Kaisa Miettinen. 2012. Nonlinear multiobjective optimization. Vol. 12. Springer Science & Business Media."},{"key":"e_1_3_2_2_50_1","volume-title":"Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes rendus hebdomadaires des s\u00e9ances de l'Acad\u00e9mie des sciences 255","author":"Moreau Jean Jacques","year":"1962","unstructured":"Jean Jacques Moreau . 1962. Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes rendus hebdomadaires des s\u00e9ances de l'Acad\u00e9mie des sciences 255 ( 1962 ), 2897--2899. Jean Jacques Moreau. 1962. Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes rendus hebdomadaires des s\u00e9ances de l'Acad\u00e9mie des sciences 255 (1962), 2897--2899."},{"key":"e_1_3_2_2_51_1","volume-title":"Controlling Fairness and Bias in Dynamic Learning-to-Rank","author":"Morik Marco","unstructured":"Marco Morik , Ashudeep Singh , Jessica Hong , and Thorsten Joachims . 2020. Controlling Fairness and Bias in Dynamic Learning-to-Rank . Association for Computing Machinery , New York, NY, USA , 429--438. https:\/\/doi.org\/10.1145\/3397271. 3401100 10.1145\/3397271 Marco Morik, Ashudeep Singh, Jessica Hong, and Thorsten Joachims. 2020. Controlling Fairness and Bias in Dynamic Learning-to-Rank. Association for Computing Machinery, New York, NY, USA, 429--438. https:\/\/doi.org\/10.1145\/3397271. 3401100"},{"key":"e_1_3_2_2_52_1","volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin . 2003. Fair division and collective welfare . MIT press . Herv\u00e9 Moulin. 2003. Fair division and collective welfare. MIT press."},{"key":"e_1_3_2_2_53_1","volume-title":"Orbit regularization. Advances in neural information processing systems 27","author":"Negrinho Renato","year":"2014","unstructured":"Renato Negrinho and Andre Martins . 2014. Orbit regularization. Advances in neural information processing systems 27 ( 2014 ), 3221--3229. Renato Negrinho and Andre Martins. 2014. Orbit regularization. Advances in neural information processing systems 27 (2014), 3221--3229."},{"key":"e_1_3_2_2_54_1","volume-title":"Smooth minimization of non-smooth functions. Mathematical programming 103, 1","author":"Nesterov Yu","year":"2005","unstructured":"Yu Nesterov . 2005. Smooth minimization of non-smooth functions. Mathematical programming 103, 1 ( 2005 ), 127--152. Yu Nesterov. 2005. Smooth minimization of non-smooth functions. Mathematical programming 103, 1 (2005), 127--152."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1188-6"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00399-5"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2020.12.001"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52485-2_5"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987174"},{"key":"e_1_3_2_2_60_1","volume-title":"FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms","author":"Patro Gourab K","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 . Association for Computing Machinery , New York, NY, USA , 1194--1204. https:\/\/doi.org\/10.1145\/3366423.3380196 10.1145\/3366423.3380196 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. Association for Computing Machinery, New York, NY, USA, 1194--1204. https:\/\/doi.org\/10.1145\/3366423.3380196"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0014"},{"key":"e_1_3_2_2_63_1","volume-title":"International conference on machine learning. PMLR, 71--79","author":"Shamir Ohad","year":"2013","unstructured":"Ohad Shamir and Tong Zhang . 2013 . Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes . In International conference on machine learning. PMLR, 71--79 . Ohad Shamir and Tong Zhang. 2013. Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes. In International conference on machine learning. PMLR, 71--79."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.2307\/2554117"},{"key":"e_1_3_2_2_65_1","volume-title":"Learning Fair Policies in Multi-Objective (Deep) Reinforcement Learning with Average and Discounted Rewards. In International Conference on Machine Learning. PMLR, 8905--8915","author":"Siddique Umer","year":"2020","unstructured":"Umer Siddique , Paul Weng , and Matthieu Zimmer . 2020 . Learning Fair Policies in Multi-Objective (Deep) Reinforcement Learning with Average and Discounted Rewards. In International Conference on Machine Learning. PMLR, 8905--8915 . Umer Siddique, Paul Weng, and Matthieu Zimmer. 2020. Learning Fair Policies in Multi-Objective (Deep) Reinforcement Learning with Average and Discounted Rewards. In International Conference on Machine Learning. PMLR, 8905--8915."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220046"},{"key":"e_1_3_2_2_68_1","volume-title":"Optimizing Rankings for Recommendation in Matching Markets. arXiv preprint arXiv:2106.01941","author":"Su Yi","year":"2021","unstructured":"Yi Su , Magd Bayoumi , and Thorsten Joachims . 2021. Optimizing Rankings for Recommendation in Matching Markets. arXiv preprint arXiv:2106.01941 ( 2021 ). Yi Su, Magd Bayoumi, and Thorsten Joachims. 2021. Optimizing Rankings for Recommendation in Matching Markets. arXiv preprint arXiv:2106.01941 (2021)."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460276.2460278"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_2_71_1","volume-title":"Lin (Eds.)","volume":"33","author":"Thekumparampil Kiran K","year":"2020","unstructured":"Kiran K Thekumparampil , Prateek Jain , Praneeth Netrapalli , and Sewoong Oh . 2020 . Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H . Lin (Eds.) , Vol. 33 . Curran Associates, Inc., 12211--12224. https:\/\/proceedings.neurips.cc\/paper\/ 2020\/file\/8f468c873a32bb0619eaeb2050ba45d1-Paper.pdf Kiran K Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh. 2020. Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin (Eds.), Vol. 33. Curran Associates, Inc., 12211--12224. https:\/\/proceedings.neurips.cc\/paper\/ 2020\/file\/8f468c873a32bb0619eaeb2050ba45d1-Paper.pdf"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472260"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(81)90018-4"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06028-6_2"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16354-3_22"},{"key":"e_1_3_2_2_76_1","volume-title":"International Conference on Machine Learning. PMLR, 6786--6797","author":"Williamson Robert","year":"2019","unstructured":"Robert Williamson and Aditya Menon . 2019 . Fairness risk measures . In International Conference on Machine Learning. PMLR, 6786--6797 . Robert Williamson and Aditya Menon. 2019. Fairness risk measures. In International Conference on Machine Learning. PMLR, 6786--6797."},{"key":"e_1_3_2_2_77_1","volume-title":"MultiFR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation. arXiv preprint arXiv:2105.02951","author":"Wu Haolun","year":"2021","unstructured":"Haolun Wu , Chen Ma , Bhaskar Mitra , Fernando Diaz , and Xue Liu . 2021. MultiFR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation. arXiv preprint arXiv:2105.02951 ( 2021 ). Haolun Wu, Chen Ma, Bhaskar Mitra, Fernando Diaz, and Xue Liu. 2021. MultiFR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation. arXiv preprint arXiv:2105.02951 (2021)."},{"key":"e_1_3_2_2_78_1","volume-title":"TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers. arXiv preprint arXiv:2104.09024","author":"Wu Yao","year":"2021","unstructured":"Yao Wu , Jian Cao , Guandong Xu , and Yudong Tan . 2021 . TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers. arXiv preprint arXiv:2104.09024 (2021). Yao Wu, Jian Cao, Guandong Xu, and Yudong Tan. 2021. TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers. arXiv preprint arXiv:2104.09024 (2021)."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809282"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.87068"},{"key":"e_1_3_2_2_81_1","volume-title":"The Gini Methodology","author":"Yitzhaki Shlomo","unstructured":"Shlomo Yitzhaki and Edna Schechtman . 2013. More than a dozen alternative ways of spelling Gini . In The Gini Methodology . Springer , 11--31. Shlomo Yitzhaki and Edna Schechtman. 2013. More than a dozen alternative ways of spelling Gini. In The Gini Methodology. Springer, 11--31."},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"crossref","unstructured":"K\u00f4saku Yosida et al. 1965. Functional analysis. (1965).  K\u00f4saku Yosida et al. 1965. Functional analysis. (1965).","DOI":"10.1007\/978-3-642-52814-9"},{"key":"e_1_3_2_2_83_1","volume-title":"International Conference on Machine Learning. PMLR, 5727--5736","author":"Yurtsever Alp","year":"2018","unstructured":"Alp Yurtsever , Olivier Fercoq , Francesco Locatello , and Volkan Cevher . 2018 . A conditional gradient framework for composite convex minimization with applications to semidefinite programming . In International Conference on Machine Learning. PMLR, 5727--5736 . Alp Yurtsever, Olivier Fercoq, Francesco Locatello, and Volkan Cevher. 2018. A conditional gradient framework for composite convex minimization with applications to semidefinite programming. In International Conference on Machine Learning. PMLR, 5727--5736."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"},{"key":"e_1_3_2_2_85_1","volume-title":"International Conference on Machine Learning. PMLR, 12967--12978","author":"Zimmer Matthieu","year":"2021","unstructured":"Matthieu Zimmer , Claire Glanois , Umer Siddique , and Paul Weng . 2021 . Learning fair policies in decentralized cooperative multi-agent reinforcement learning . In International Conference on Machine Learning. PMLR, 12967--12978 . Matthieu Zimmer, Claire Glanois, Umer Siddique, and Paul Weng. 2021. Learning fair policies in decentralized cooperative multi-agent reinforcement learning. In International Conference on Machine Learning. PMLR, 12967--12978."}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Madrid Spain","acronym":"SIGIR '22","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3532035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:34Z","timestamp":1750183834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3532035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":84,"alternative-id":["10.1145\/3477495.3532035","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3532035","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}