{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:35Z","timestamp":1750220075965,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":72,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2112665, IIS-2045951"],"award-info":[{"award-number":["CCF-2112665, IIS-2045951"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583195","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"3625-3636","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing Submodular Functions for Recommendation\u00a0in\u00a0the\u00a0Presence of Biases"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8566-5452","authenticated-orcid":false,"given":"Anay","family":"Mehrotra","sequence":"first","affiliation":[{"name":"Yale University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0255-1119","authenticated-orcid":false,"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"Yale University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_2_2_1","first-page":"14","volume-title":"WSDM","author":"Agrawal Rakesh","unstructured":"[2] Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong. Diversifying Search Results. In WSDM, pages 5\u201314. ACM, 2009."},{"key":"e_1_3_2_2_3_1","volume-title":"Algorithmica","author":"Asudeh Abolfazl","year":"2022","unstructured":"[3] Abolfazl Asudeh, Tanya Berger-Wolf, Bhaskar DasGupta, and Anastasios Sidiropoulos. Maximizing coverage while ensuring fairness: A tale of conflicting objectives. Algorithmica, 2022."},{"key":"e_1_3_2_2_4_1","first-page":"51","volume-title":"Micha\u0142 Pilipczuk, and Pawe\u0142 Rz\u0105\u017cewski","author":"Bandyapadhyay Sayan","year":"2021","unstructured":"[4] Sayan Bandyapadhyay, Aritra Banik, and Sujoy Bhore. On fair covering and hitting problems. In \u0141ukasz Kowalik, Micha\u0142 Pilipczuk, and Pawe\u0142 Rz\u0105\u017cewski, editors, Graph-Theoretic Concepts in Computer Science, pages 39\u201351, Cham, 2021. Springer International Publishing."},{"key":"e_1_3_2_2_5_1","volume-title":"Fairness and Machine Learning. fairmlbook.org","author":"Barocas Solon","year":"2019","unstructured":"[5] Solon Barocas, Moritz Hardt, and Arvind Narayanan. Fairness and Machine Learning. fairmlbook.org, 2019. http:\/\/www.fairmlbook.org."},{"key":"e_1_3_2_2_6_1","volume-title":"January","author":"Bereznak Alyssa","year":"2019","unstructured":"[6] Alyssa Bereznak. The Problem With IMDb\u2019s Rating System, January 2019. https:\/\/www.theringer.com\/tv\/2019\/6\/12\/18661850\/imdb-rating-system-problems-chernobyl."},{"key":"e_1_3_2_2_7_1","volume-title":"Are Emily and Greg More Employable than Lakisha and Jamal? A Field Experiment on Labor Market Discrimination. American economic review, 94(4):991\u20131013","author":"Bertrand Marianne","year":"2004","unstructured":"[7] Marianne Bertrand and Sendhil Mullainathan. Are Emily and Greg More Employable than Lakisha and Jamal? A Field Experiment on Labor Market Discrimination. American economic review, 94(4):991\u20131013, 2004."},{"key":"e_1_3_2_2_8_1","first-page":"414","volume-title":"SIGIR","author":"Biega J.","unstructured":"[8] Asia\u00a0J. Biega, Krishna\u00a0P. Gummadi, and Gerhard Weikum. Equity of attention: Amortizing individual fairness in rankings. In SIGIR, pages 405\u2013414. ACM, 2018."},{"key":"e_1_3_2_2_9_1","volume-title":"Fairness in Maximal Covering Location Problems","author":"Blanco V\u00edctor","year":"2022","unstructured":"[9] V\u00edctor Blanco and Ricardo G\u00e1zquez. Fairness in Maximal Covering Location Problems, 2022."},{"key":"e_1_3_2_2_10_1","volume-title":"The Complexity of Finding Fair Many-to-One Matchings","author":"Boehmer Niclas","year":"2022","unstructured":"[10] Niclas Boehmer and Tomohiro Koana. The Complexity of Finding Fair Many-to-One Matchings, 2022."},{"key":"e_1_3_2_2_11_1","volume-title":"What Works: Gender Equality by Design","author":"Bohnet Iris","year":"2016","unstructured":"[11] Iris Bohnet. What Works: Gender Equality by Design. Harvard University Press, 2016."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(82)90033-4"},{"key":"e_1_3_2_2_13_1","first-page":"2945","volume-title":"Artist and Platform Objectives for Music Sequencing. In WWW","author":"Bugliarello Emanuele","unstructured":"[13] Emanuele Bugliarello, Rishabh Mehrotra, James Kirk, and Mounia Lalmas. Mostra: A Flexible Balancing Framework to Trade-off User, Artist and Platform Objectives for Music Sequencing. In WWW, pages 2936\u20132945. ACM, 2022."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_2_15_1","first-page":"689","volume-title":"Nisheeth\u00a0K. Vishnoi. The Effect of the Rooney Rule on Implicit Bias in the Long Term. In Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, FAccT \u201921","author":"Celis Elisa","year":"2021","unstructured":"[15] L.\u00a0Elisa Celis, Chris Hays, Anay Mehrotra, and Nisheeth\u00a0K. Vishnoi. The Effect of the Rooney Rule on Implicit Bias in the Long Term. In Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, FAccT \u201921, page 678\u2013689, New York, NY, USA, 2021. Association for Computing Machinery."},{"key":"e_1_3_2_2_16_1","first-page":"151","volume-title":"IJCAI","author":"Celis Elisa","unstructured":"[16] L.\u00a0Elisa Celis, Lingxiao Huang, and Nisheeth\u00a0K. Vishnoi. Multiwinner voting with fairness constraints. In IJCAI, pages 144\u2013151. ijcai.org, 2018."},{"key":"e_1_3_2_2_17_1","volume-title":"ACM","author":"Celis Elisa","year":"2020","unstructured":"[17] L.\u00a0Elisa Celis, Anay Mehrotra, and Nisheeth\u00a0K. Vishnoi. Interventions for Ranking in the Presence of Implicit Bias. In FAT*, pages 369\u2013380. ACM, 2020."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/642611.642713"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000079"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-020-09284-2"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557056"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103609"},{"key":"e_1_3_2_2_24_1","volume-title":"April","author":"Engineering Spotify","year":"2020","unstructured":"[24] Spotify Engineering. Reach for the Top: How Spotify Built Shortcuts in Just Six Months, April 2020. https:\/\/engineering.atspotify.com\/reach-for-the-top-how-spotify-built-shortcuts-in-just-six-months\/."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_2_26_1","volume-title":"Springer","author":"Fisher L","year":"1978","unstructured":"[26] Marshall\u00a0L Fisher, George\u00a0L Nemhauser, and Laurence\u00a0A Wolsey. An Analysis of Approximations for Maximizing Submodular Set Functions \u2014II. In Polyhedral combinatorics, pages 73\u201387. Springer, 1978."},{"key":"e_1_3_2_2_27_1","first-page":"2231","volume-title":"KDD","author":"Geyik Sahin\u00a0Cem","unstructured":"[27] Sahin\u00a0Cem Geyik, Stuart Ambler, and Krishnaram Kenthapadi. Fairness-aware ranking in search & recommendation systems with application to linkedin talent search. In KDD, pages 2221\u20132231. ACM, 2019."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/20439056"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.2753\/JEC1086-4415110204"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2998181.2998327"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445867"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0403723101"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/orsc.1090.0491"},{"key":"e_1_3_2_2_36_1","volume-title":"Considerations on recommendation independence for a find-good-items task","author":"Kamishima Toshihiro","year":"2017","unstructured":"[36] Toshihiro Kamishima and Shotaro Akaho. Considerations on recommendation independence for a find-good-items task. 2017."},{"key":"e_1_3_2_2_37_1","first-page":"3828","volume-title":"Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems, CHI 2015","author":"Kay Matthew","year":"2015","unstructured":"[37] Matthew Kay, Cynthia Matuszek, and Sean\u00a0A. Munson. Unequal Representation and Gender Stereotypes in Image Search Results for Occupations. In Bo\u00a0Begole, Jinwoo Kim, Kori Inkpen, and Woontack Woo, editors, Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems, CHI 2015, Seoul, Republic of Korea, April 18-23, 2015, pages 3819\u20133828, Seoul, Republic of Korea, 2015. ACM."},{"key":"e_1_3_2_2_38_1","first-page":"2572","volume-title":"Proceedings of the 35th International Conference on Machine Learning, volume\u00a080 of Proceedings of Machine Learning Research","author":"Kearns Michael","unstructured":"[38] Michael Kearns, Seth Neel, Aaron Roth, and Zhiwei\u00a0Steven Wu. Preventing fairness gerrymandering: Auditing and learning for subgroup fairness. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume\u00a080 of Proceedings of Machine Learning Research, pages 2564\u20132572. PMLR, 10\u201315 Jul 2018."},{"key":"e_1_3_2_2_39_1","first-page":"3814","volume-title":"WWW","author":"Keswani Vijay","unstructured":"[39] Vijay Keswani and L.\u00a0Elisa Celis. Dialect Diversity in Text Summarization on Twitter. In WWW, pages 3802\u20133814. ACM \/ IW3C2, 2021."},{"key":"e_1_3_2_2_40_1","volume-title":"Team Performance with Test Scores. ACM Trans. Econ. Comput., 6(3\u20134), oct","author":"Kleinberg Jon","year":"2018","unstructured":"[40] Jon Kleinberg and Maithra Raghu. Team Performance with Test Scores. ACM Trans. Econ. Comput., 6(3\u20134), oct 2018."},{"key":"e_1_3_2_2_41_1","volume-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik","author":"M.","year":"2018","unstructured":"[41] Jon\u00a0M. Kleinberg and Manish Raghavan. Selection Problems in the Presence of Implicit Bias. In ITCS, volume\u00a094 of LIPIcs, pages 33:1\u201333:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2018."},{"key":"e_1_3_2_2_42_1","first-page":"71","volume":"3","author":"Krause Andreas","year":"2014","unstructured":"[42] Andreas Krause and Daniel Golovin. Submodular Function Maximization. Tractability, 3:71\u2013104, 2014.","journal-title":"Submodular Function Maximization. Tractability"},{"key":"e_1_3_2_2_43_1","first-page":"386","volume-title":"Shasha Xie. Graph-Based Submodular Selection for Extractive Summarization. In 2009 IEEE Workshop on Automatic Speech Recognition & Understanding","author":"Lin Hui","unstructured":"[43] Hui Lin, Jeff Bilmes, and Shasha Xie. Graph-Based Submodular Selection for Extractive Summarization. In 2009 IEEE Workshop on Automatic Speech Recognition & Understanding, pages 381\u2013386. IEEE, 2009."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1037\/0021-9010.91.4.777"},{"issue":"1","key":"e_1_3_2_2_45_1","first-page":"100","article-title":"Introduction to information retrieval","volume":"16","author":"Manning Christopher","year":"2010","unstructured":"[45] Christopher Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. Introduction to information retrieval. Natural Language Engineering, 16(1):100\u2013103, 2010.","journal-title":"Natural Language Engineering"},{"issue":"1","key":"e_1_3_2_2_46_1","first-page":"100","article-title":"Introduction to Information Retrieval","volume":"16","author":"Manning Christopher","year":"2010","unstructured":"[46] Christopher Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. Introduction to Information Retrieval. Natural Language Engineering, 16(1):100\u2013103, 2010.","journal-title":"Natural Language Engineering"},{"key":"e_1_3_2_2_47_1","volume-title":"ACM","author":"Mehrotra Anay","year":"2022","unstructured":"[47] Anay Mehrotra, Bary S.\u00a0R. Pradelski, and Nisheeth\u00a0K. Vishnoi. Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints. In FAccT, page To appear. ACM, 2022."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054197"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_2_50_1","volume-title":"Can Afford To Ignore The Trolls Who Sabotaged \u2019Ghostbusters","author":"Mendelson Scott","year":"2018","unstructured":"[50] Scott Mendelson. \u2019Ocean\u2019s 8\u2019 Can Afford To Ignore The Trolls Who Sabotaged \u2019Ghostbusters\u2019, May 2018. https:\/\/www.forbes.com\/sites\/scottmendelson\/2018\/05\/17\/box-office-oceans-8-sandra-bullock-cate-blanchett-anne-hathaway-ghostbusters-rihanna\/?sh=76cfd561596d."},{"key":"e_1_3_2_2_51_1","volume-title":"October","author":"Mims Christopher","year":"2020","unstructured":"[51] Christopher Mims. Why social media is so good at polarizing us, October 2020. https:\/\/www.wsj.com\/articles\/why-social-media-is-so-good-at-polarizing-us-11603105204."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0006528"},{"key":"e_1_3_2_2_53_1","first-page":"1367","volume-title":"Proceedings of The 33rd International Conference on Machine Learning, volume\u00a048 of Proceedings of Machine Learning Research","author":"Mirzasoleiman Baharan","year":"2016","unstructured":"[53] Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, and Amin Karbasi. Fast Constrained Submodular Maximization: Personalized Data Summarization. In Maria\u00a0Florina Balcan and Kilian\u00a0Q. Weinberger, editors, Proceedings of The 33rd International Conference on Machine Learning, volume\u00a048 of Proceedings of Machine Learning Research, pages 1358\u20131367, New York, New York, USA, 20\u201322 Jun 2016. PMLR."},{"key":"e_1_3_2_2_54_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence, 29(1)","author":"Mirzasoleiman Baharan","year":"2015","unstructured":"[54] Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrak, and Andreas Krause. Lazier Than Lazy Greedy. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1), Feb. 2015."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3053517"},{"key":"e_1_3_2_2_56_1","volume-title":"Diversifying Music Recommendations. CoRR, abs\/1810.01482","author":"Nassif Houssam","year":"2018","unstructured":"[56] Houssam Nassif, Kemal\u00a0Oral Cansizlar, Mitchell Goodman, and S.\u00a0V.\u00a0N. Vishwanathan. Diversifying Music Recommendations. CoRR, abs\/1810.01482, 2018."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.18574\/nyu\/9781479833641.001.0001"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2019.00013"},{"key":"e_1_3_2_2_60_1","volume-title":"ACM","author":"Patro K.","year":"2022","unstructured":"[60] Gourab\u00a0K. Patro, Lorenzo Porcaro, Laura Mitchell, Qiuyue Zhang, Meike Zehlike, and Nikhil Garg. Fair Ranking: A Critical Review, Challenges, and Future Directions. In FAccT, page To appear. ACM, 2022."},{"key":"e_1_3_2_2_61_1","volume-title":"The VLDB Journal","author":"Pitoura Evaggelia","year":"2021","unstructured":"[61] Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. Fairness in Rankings and Recommendations: An Overview. The VLDB Journal, 2021."},{"key":"e_1_3_2_2_62_1","volume-title":"Spotify Adopts Indian Habits to Avoid the \u2018Netflix Problem","author":"Saha Soumyajit","year":"2022","unstructured":"[62] Soumyajit Saha. Spotify Adopts Indian Habits to Avoid the \u2018Netflix Problem\u2019, May 2022. https:\/\/the-ken.com\/story\/spotify-adopts-indian-habits-to-avoid-the-netflix-problem\/."},{"key":"e_1_3_2_2_63_1","first-page":"2228","volume-title":"KDD","author":"Singh Ashudeep","unstructured":"[63] Ashudeep Singh and Thorsten Joachims. Fairness of Exposure in Rankings. In KDD, pages 2219\u20132228. ACM, 2018."},{"key":"e_1_3_2_2_64_1","volume-title":"June","author":"Tauberg Michael","year":"2018","unstructured":"[64] Michael Tauberg. Power Law in Popular Media, June 2018. https:\/\/michaeltauberg.medium.com\/power-law-in-popular-media-7d7efef3fb7c."},{"key":"e_1_3_2_2_65_1","first-page":"38","volume-title":"Personalized Diversity for Visual Discovery. In Proceedings of the 10th ACM Conference on Recommender Systems, RecSys \u201916","author":"Teo Choon\u00a0Hui","year":"2016","unstructured":"[65] Choon\u00a0Hui Teo, Houssam Nassif, Daniel Hill, Sriram Srinivasan, Mitchell Goodman, Vijai Mohan, and S.V.N. Vishwanathan. Adaptive, Personalized Diversity for Visual Discovery. In Proceedings of the 10th ACM Conference on Recommender Systems, RecSys \u201916, page 35\u201338, New York, NY, USA, 2016. Association for Computing Machinery."},{"key":"e_1_3_2_2_66_1","first-page":"7","volume-title":"Proceedings of the International Workshop on Software Fairness, FairWare@ICSE 2018","author":"Verma Sahil","year":"2018","unstructured":"[66] Sahil Verma and Julia Rubin. Fairness Definitions Explained. In Yuriy Brun, Brittany Johnson, and Alexandra Meliou, editors, Proceedings of the International Workshop on Software Fairness, FairWare@ICSE 2018, Gothenburg, Sweden, May 29, 2018, pages 1\u20137, Gothenburg, Sweden, 2018. ACM."},{"key":"e_1_3_2_2_67_1","volume-title":"echnical Report)","author":"Wang Yanhao","year":"2022","unstructured":"[67] Yanhao Wang, Yuchen Li, Francesco Bonchi, and Ying Wang. Balancing Utility and Fairness in Submodular Maximization (Technical Report), 2022."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1038\/387341a0"},{"key":"e_1_3_2_2_69_1","first-page":"6042","volume-title":"IJCAI","author":"Gkatzelis Vasilis","unstructured":"[69] Ke\u00a0Yang, Vasilis Gkatzelis, and Julia Stoyanovich. Balanced ranking with diversity constraints. In IJCAI, pages 6035\u20136042. ijcai.org, 2019."},{"key":"e_1_3_2_2_70_1","series-title":"LIPIcs","first-page":"20","volume-title":"FORC","author":"Loftus R.","unstructured":"[70] Ke\u00a0Yang, Joshua\u00a0R. Loftus, and Julia Stoyanovich. Causal intersectionality and fair ranking. In FORC, volume 192 of LIPIcs, pages 7:1\u20137:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"e_1_3_2_2_71_1","volume-title":"Beyond parity: Fairness objectives for collaborative filtering. Advances in neural information processing systems, 30","author":"Yao Sirui","year":"2017","unstructured":"[71] Sirui Yao and Bert Huang. Beyond parity: Fairness objectives for collaborative filtering. Advances in neural information processing systems, 30, 2017."},{"key":"e_1_3_2_2_72_1","first-page":"2855","volume-title":"WWW","author":"Zehlike Meike","unstructured":"[72] Meike Zehlike and Carlos Castillo. Reducing disparate exposure in ranking: A learning to rank approach. In WWW, pages 2849\u20132855. ACM \/ IW3C2, 2020."},{"key":"e_1_3_2_2_73_1","volume-title":"Fairness in Ranking, Part I: Score-Based Ranking. ACM Comput. Surv., apr","author":"Zehlike Meike","year":"2022","unstructured":"[73] Meike Zehlike, Ke\u00a0Yang, and Julia Stoyanovich. Fairness in Ranking, Part I: Score-Based Ranking. ACM Comput. Surv., apr 2022. Just Accepted."}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3543507.3583195","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583195","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:18Z","timestamp":1750183758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":72,"alternative-id":["10.1145\/3543507.3583195","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583195","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}