{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:07:37Z","timestamp":1768334857281,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030524845","type":"print"},{"value":"9783030524852","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52485-2_1","type":"book-chapter","created":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T07:02:59Z","timestamp":1594450979000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Facets of Fairness in Search and Recommendation"],"prefix":"10.1007","author":[{"given":"Sahil","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8784-4171","authenticated-orcid":false,"given":"Ruoyuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3797-4293","authenticated-orcid":false,"given":"Chirag","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,12]]},"reference":[{"key":"1_CR1","unstructured":"Protected Group. \nhttps:\/\/en.wikipedia.org\/wiki\/Protected_group\n\n. Accessed 20 Jan 2020"},{"key":"1_CR2","unstructured":"What is Search Neutrality? \nhttps:\/\/hackernoon.com\/what-is-search-neutrality-d05cc30c6b3e\n\n. Accessed 20 Jan 2020"},{"key":"1_CR3","unstructured":"Women less likely to be shown ads for high-paid jobs on Google, study shows. \nhttps:\/\/www.theguardian.com\/technology\/2015\/jul\/08\/women-less-likely-ads-high-paid-jobs-google-study\n\n. Accessed 20 Jan 2020"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Abdollahpouri, H., Burke, R., Mobasher, B.: Recommender systems as multistakeholder environments. In: Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization, UMAP 2017. Association for Computing Machinery, New York (2017). \nhttps:\/\/doi.org\/10.1145\/3079628.3079657","DOI":"10.1145\/3079628.3079657"},{"key":"1_CR5","unstructured":"Abdollahpouri, H., Burke, R.D.: Multi-stakeholder recommendation and its connection to multi-sided fairness. ArXiv abs\/1907.13158 (2019)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Amig\u00f3, E., Spina, D., Carrillo-de Albornoz, J.: An axiomatic analysis of diversity evaluation metrics: Introducing the rank-biased utility metric. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR 2018. Association for Computing Machinery, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3209978.3210024","DOI":"10.1145\/3209978.3210024"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Beutel, A., et al.: Fairness in recommendation ranking through pairwise comparisons. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3292500.3330745","DOI":"10.1145\/3292500.3330745"},{"key":"1_CR8","unstructured":"Burke, R.: Multisided Fairness for Recommendation. \narXiv:1707.00093\n\n [cs], July 2017"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Chakraborty, A., Patro, G.K., Ganguly, N., Gummadi, K.P., Loiseau, P.: Equality of voice: towards fair representation in crowdsourced top-k recommendations. In: Proceedings of the Conference on Fairness, Accountability, and Transparency. FAT* 2019. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3287560.3287570","DOI":"10.1145\/3287560.3287570"},{"key":"1_CR10","unstructured":"Datta, A., Tschantz, M.C., Datta, A.: Automated experiments on ad privacy settings: A tale of opacity, choice, and discrimination. ArXiv abs\/1408.6491 (2014)"},{"key":"1_CR11","unstructured":"Ferraro, A., Bogdanov, D., Serra, X., Yoon, J.J.: Artist and style exposure bias in collaborative filtering based music recommendations. ArXiv abs\/1911.04827 (2019)"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Gao, R., Shah, C.: Toward creating a fairer ranking in search engine results. Inf. Process. Manag. 57, (2020). \nhttps:\/\/doi.org\/10.1016\/j.ipm.2019.102138","DOI":"10.1016\/j.ipm.2019.102138"},{"key":"1_CR13","doi-asserted-by":"publisher","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 & Data Mining, KDD 2019. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3292500.3330691","DOI":"10.1145\/3292500.3330691"},{"key":"1_CR14","volume-title":"Some skepticism about search neutrality","author":"J Grimmelmann","year":"2011","unstructured":"Grimmelmann, J.: Some skepticism about search neutrality. Essays on the Future of the Internet, The Next Digital Decade (2011)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Heidari, H., Krause, A.: Preventing disparate treatment in sequential decision making. In: IJCAI (2018)","DOI":"10.24963\/ijcai.2018\/311"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Ilvento, C., Jagadeesan, M., Chawla, S.: Multi-category fairness in sponsored search auctions. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, FAT* 2020. Association for Computing Machinery, New York (2020). \nhttps:\/\/doi.org\/10.1145\/3351095.3372848","DOI":"10.1145\/3351095.3372848"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Kuhlman, C., VanValkenburg, M., Rundensteiner, E.: Fare: diagnostics for fair ranking using pairwise error metrics. In: The World Wide Web Conference, WWW 2019. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3308558.3313443","DOI":"10.1145\/3308558.3313443"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Mehrotra, R., McInerney, J., Bouchard, H., Lalmas, M., Diaz, F.: Towards a fair marketplace: Counterfactual evaluation of the trade-off between relevance, fairness & satisfaction in recommendation systems. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018. Association for Computing Machinery, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3269206.3272027","DOI":"10.1145\/3269206.3272027"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Richardson, M., Dominowska, E., Ragno, R.: Predicting clicks: Estimating the click-through rate for new ads. In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007. Association for Computing Machinery, New York (2007). \nhttps:\/\/doi.org\/10.1145\/1242572.1242643","DOI":"10.1145\/1242572.1242643"},{"key":"1_CR20","unstructured":"Sakai, T., Craswell, N., Song, R., Robertson, S.E., Dou, Z., Lin, C.Y.: Simple evaluation metrics for diversified search results. In: EVIA@NTCIR (2010)"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Serbos, D., Qi, S., Mamoulis, N., Pitoura, E., Tsaparas, P.: Fairness in package-to-group recommendations. In: Proceedings of the 26th International Conference on World Wide Web, WWW 2017, International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE (2017). \nhttps:\/\/doi.org\/10.1145\/3038912.3052612","DOI":"10.1145\/3038912.3052612"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Singh, A., Joachims, T.: Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018. Association for Computing Machinery, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3219819.3220088","DOI":"10.1145\/3219819.3220088"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: Proceedings of the International Workshop on Software Fairness, FairWare 2018. Association for Computing Machinery, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3194770.3194776","DOI":"10.1145\/3194770.3194776"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Wan, M., Ni, J., Misra, R., McAuley, J.: Addressing marketing bias in product recommendations. In: Proceedings of the 13th International Conference on Web Search and Data Mining, WSDM 2020. Association for Computing Machinery, New York (2020). \nhttps:\/\/doi.org\/10.1145\/3336191.3371855","DOI":"10.1145\/3336191.3371855"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Wu, Y., Zhang, L., Wu, X.: On discrimination discovery and removal in ranked data using causal graph. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018. Association for Computing Machinery, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3219819.3220087","DOI":"10.1145\/3219819.3220087"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Yang, K., Stoyanovich, J.: Measuring fairness in ranked outputs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management, SSDBM 2017. Association for Computing Machinery, New York (2017). \nhttps:\/\/doi.org\/10.1145\/3085504.3085526","DOI":"10.1145\/3085504.3085526"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., Baeza-Yates, R.: Fa*ir: a fair top-k ranking algorithm. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017. Association for Computing Machinery, New York (2017). \nhttps:\/\/doi.org\/10.1145\/3132847.3132938","DOI":"10.1145\/3132847.3132938"}],"container-title":["Communications in Computer and Information Science","Bias and Social Aspects in Search and Recommendation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52485-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T13:57:40Z","timestamp":1598882260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52485-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030524845","9783030524852"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52485-2_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"12 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithmic Bias in Search and Recommendation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bias2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bias.disim.univaq.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"BIAS 2020 was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}