{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:24:29Z","timestamp":1755926669301,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"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,6,21]]},"DOI":"10.1145\/3531146.3534633","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T14:27:10Z","timestamp":1655735230000},"page":"2157-2167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast online ranking with fairness of exposure"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Usunier","sequence":"first","affiliation":[{"name":"Meta AI, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virginie","family":"Do","sequence":"additional","affiliation":[{"name":"Universite Paris Dauphine-PSL, France and Meta AI, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elvis","family":"Dohmatob","sequence":"additional","affiliation":[{"name":"Meta AI, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Unfairness of Popularity Bias in Recommendation. In RecSys Workshop on Recommendation in Multistakeholder Environments (RMSE).","author":"Abdollahpouri Himan","year":"2019","unstructured":"Himan Abdollahpouri, Masoud Mansoury, Robin Burke, and Bamshad Mobasher. 2019. The Unfairness of Popularity Bias in Recommendation. In RecSys Workshop on Recommendation in Multistakeholder Environments (RMSE)."},{"key":"e_1_3_2_1_2_1","unstructured":"Quentin Berthet and Vianney Perchet. 2017. Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_4_1","unstructured":"L\u00e9on Bottou and Olivier Bousquet. 2008. The Tradeoffs of Large Scale Learning. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567766"},{"key":"e_1_3_2_1_6_1","unstructured":"Robin Burke. 2017. Multisided Fairness for Recommendation. arxiv:1707.00093\u00a0[cs.CY]"},{"key":"e_1_3_2_1_7_1","unstructured":"L.\u00a0Elisa Celis Damian Straszak and Nisheeth\u00a0K. Vishnoi. 2018. Ranking with Fairness Constraints. arxiv:1704.06840\u00a0[cs.DS]"},{"volume-title":"Music Recommendation and Discovery in the Long Tail","author":"Celma O.","key":"e_1_3_2_1_8_1","unstructured":"O. Celma. 2010. Music Recommendation and Discovery in the Long Tail. Springer."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287570"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_11_1","volume-title":"Conference on Neural Information Processing Systems.","author":"Do Virginie","year":"2021","unstructured":"Virginie Do, Sam Corbett-Davies, Jamal Atif, and Nicolas Usunier. 2021. Two-sided fairness in rankings via Lorenz dominance. In Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_12_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\u2013110."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663744"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3042573.3042808"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_1_18_1","volume-title":"Auditing for Discrimination in Algorithms Delivering Job Ads. In The Web Conference.","author":"Imana Basileal","year":"2021","unstructured":"Basileal Imana, Aleksandra Korolova, and John Heidemann. 2021. Auditing for Discrimination in Algorithms Delivering Job Ads. In The Web Conference."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474248"},{"key":"e_1_3_2_1_20_1","volume-title":"Preference Amplification in Recommender Systems. In ACM Conference on Knowledge Discovery & Data Mining.","author":"Kalimeris Dimitris","year":"2021","unstructured":"Dimitris Kalimeris, Smriti Bhagat, Shankar Kalyanaraman, and Udi Weinsberg. 2021. Preference Amplification in Recommender Systems. In ACM Conference on Knowledge Discovery & Data Mining."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702520"},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning.","author":"Kerdreux Thomas","year":"2018","unstructured":"Thomas Kerdreux, Fabian Pedregosa, and Alexandre d\u2019Aspremont. 2018. Frank-Wolfe with subsampling oracle. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Yehuda Koren and Robert Bell. 2015. Advances in collaborative filtering. Recommender systems handbook(2015) 77\u2013118.","DOI":"10.1007\/978-1-4899-7637-6_3"},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Learning.","author":"Lacoste-Julien Simon","year":"2013","unstructured":"Simon Lacoste-Julien, Martin Jaggi, Mark Schmidt, and Patrick Pletscher. 2013. Block-coordinate Frank-Wolfe optimization for structural SVMs. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_25_1","unstructured":"Jean Lafond Hoi-To Wai and Eric Moulines. 2016. On the Online Frank-Wolfe Algorithms for Convex and Non-convex Optimizations. arxiv:1510.01171\u00a0[stat.ML]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3093"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347016"},{"key":"e_1_3_2_1_28_1","unstructured":"Masoud Mansoury Himan Abdollahpouri Bamshad Mobasher Mykola Pechenizkiy Robin Burke and Milad Sabouri. 2021. Unbiased Cascade Bandits: Mitigating Exposure Bias in Online Learning to Rank Recommendation. arxiv:2108.03440\u00a0[cs.IR]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054197"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_1_31_1","volume-title":"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 International Conference on Machine Learning."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380196"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_35_1","volume-title":"Policy Learning for Fairness in Ranking. In Conference on Neural Information Processing Systems.","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. In Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_36_1","unstructured":"Jonathan Stray Ivan Vendrov Jeremy Nixon Steven Adler and Dylan Hadfield-Menell. 2021. What are you optimizing for? Aligning Recommender Systems with Human Values. arxiv:2107.10939\u00a0[cs.IR]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460276.2460278"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461702.3462540"},{"key":"e_1_3_2_1_39_1","unstructured":"Lequn Wang Yiwei Bai Wen Sun and Thorsten Joachims. 2021. Fairness of Exposure in Stochastic Bandits. arxiv:2103.02735\u00a0[cs.LG]"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462882"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449901"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449889"}],"event":{"name":"FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency","sponsor":["ACM Association for Computing Machinery"],"location":"Seoul Republic of Korea","acronym":"FAccT '22"},"container-title":["2022 ACM Conference on Fairness Accountability and Transparency"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3534633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531146.3534633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:31Z","timestamp":1750188691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3534633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":43,"alternative-id":["10.1145\/3531146.3534633","10.1145\/3531146"],"URL":"https:\/\/doi.org\/10.1145\/3531146.3534633","relation":{},"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"2022-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}