{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:54:35Z","timestamp":1743062075036,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030524845"},{"type":"electronic","value":"9783030524852"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/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":"https:\/\/linproxy.fan.workers.dev:443\/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_5","type":"book-chapter","created":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T07:02:59Z","timestamp":1594450979000},"page":"43-57","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Matchmaking Under Fairness Constraints: A Speed Dating Case Study"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Paraschakis","sequence":"first","affiliation":[]},{"given":"Bengt J.","family":"Nilsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,12]]},"reference":[{"issue":"1\u20133","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(96)00105-9","volume":"81","author":"RJ Alfons\u00edn","year":"1998","unstructured":"Alfons\u00edn, R.J.: On variations of the subset sum problem. Discrete Appl. Math. 81(1\u20133), 1\u20137 (1998)","journal-title":"Discrete Appl. Math."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Biega, A.J., Gummadi, K.P., Weikum, G.: Equity of attention: amortizing individual fairness in rankings. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR 2018, pp. 405\u2013414. ACM (2018)","DOI":"10.1145\/3209978.3210063"},{"key":"5_CR3","unstructured":"Burke, R.: Multisided fairness for recommendation. CoRR abs\/1707.00093 (2017). https:\/\/linproxy.fan.workers.dev:443\/http\/arxiv.org\/abs\/1707.00093"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.1030.0050","volume":"17","author":"P Cappanera","year":"2005","unstructured":"Cappanera, P., Trubian, M.: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem. INFORMS J. Comput. 17(1), 82\u201398 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2), 333\u2013345 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 214\u2013226. ACM (2012)","DOI":"10.1145\/2090236.2090255"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/qjec.2006.121.2.673","volume":"121","author":"R Fisman","year":"2006","unstructured":"Fisman, R., Iyengar, S.S., Kamenica, E., Simonson, I.: Gender differences in mate selection: evidence from a speed dating experiment. Q. J. Econ. 121(2), 673\u2013697 (2006)","journal-title":"Q. J. Econ."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1111\/j.1467-937X.2007.00465.x","volume":"75","author":"R Fisman","year":"2008","unstructured":"Fisman, R., Iyengar, S.S., Kamenica, E., Simonson, I.: Racial preferences in dating. Rev. Econ. Stud. 75(1), 117\u2013132 (2008)","journal-title":"Rev. Econ. Stud."},{"key":"5_CR9","unstructured":"Gajane, P., Pechenizkiy, M.: On formalizing fairness in prediction with machine learning. CoRR abs\/1710.03184 (2017). https:\/\/linproxy.fan.workers.dev:443\/http\/arxiv.org\/abs\/1710.03184"},{"key":"5_CR10","unstructured":"Gosepath, S.: Equality. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, 2011 edn. Metaphysics Research Lab, Stanford University, Spring (2011)"},{"issue":"CSCW","key":"5_CR11","doi-asserted-by":"publisher","first-page":"73:1","DOI":"10.1145\/3274342","volume":"2","author":"JA Hutson","year":"2018","unstructured":"Hutson, J.A., Taft, J.G., Barocas, S., Levy, K.: Debiasing desire: addressing bias & discrimination on intimate platforms. Proc. ACM Hum.-Comput. Interact. 2(CSCW), 73:1\u201373:18 (2018)","journal-title":"Proc. ACM Hum.-Comput. Interact."},{"issue":"10","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1177\/0956797617714580","volume":"28","author":"S Joel","year":"2017","unstructured":"Joel, S., Eastwick, P.W., Finkel, E.J.: Is romantic desire predictable? Machine learning applied to initial romantic attraction. Psychol. Sci. 28(10), 1478\u20131489 (2017)","journal-title":"Psychol. Sci."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Joseph, M., Kearns, M., Morgenstern, J., Neel, S., Roth, A.: Meritocratic fairness for infinite and contextual bandits. In: Proceedings of the 2018 AAAI\/ACM Conference on AI, Ethics, and Society, AIES 2018, pp. 158\u2013163. ACM (2018)","DOI":"10.1145\/3278721.3278764"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Kamishima, T., Akaho, S., Asoh, H.: Enhancement of the neutrality in recommendation. In: Proceedings of the 2nd Workshop on Human Decision Making in Recommender Systems, pp. 8\u201314 (2012)","DOI":"10.1145\/2039320.2039329"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Karako, C., Manggala, P.: Using image fairness representations in diversity-based re-ranking for recommendations. In: Adjunct Publication of the 26th Conference on User Modeling, Adaptation and Personalization, UMAP 2018, pp. 23\u201328. ACM (2018)","DOI":"10.1145\/3213586.3226206"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Kyriakidi, M., Stefanidis, K., Ioannidis, Y.: On achieving diversity in recommender systems. In: Proceedings of the ExploreDB 2017, pp. 4:1\u20134:6. ACM (2017)","DOI":"10.1145\/3077331.3077341"},{"key":"5_CR17","unstructured":"Liu, W., Burke, R.: Personalizing fairness-aware re-ranking. CoRR abs\/1809.02921 (2018). https:\/\/linproxy.fan.workers.dev:443\/http\/arxiv.org\/abs\/1809.02921"},{"key":"5_CR18","unstructured":"Liu, Y., Radanovic, G., Dimitrakakis, C., Mandal, D., Parkes, D.C.: Calibrated fairness in bandits. In: Proceedings of the 4th Workshop on Fairness, Accountability, and Transparency in Machine Learning (Fat\/ML 2017) (2017). https:\/\/linproxy.fan.workers.dev:443\/https\/arxiv.org\/abs\/1707.01875"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0304-0208(08)73237-7","volume":"132","author":"S Martello","year":"1987","unstructured":"Martello, S., Toth, P.: Algorithms for knapsack problems. North-Holland Math. Stud. 132, 213\u2013257 (1987)","journal-title":"North-Holland Math. Stud."},{"key":"5_CR20","unstructured":"Notopoulos, K.: The dating app that knows you secretly aren\u2019t into guys from other races, January 2016. https:\/\/linproxy.fan.workers.dev:443\/https\/www.buzzfeednews.com\/article\/katienotopoulos\/coffee-meets-bagel-racial-preferences . Accessed 26 June 2019"},{"issue":"5\u20136","key":"5_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1023\/A:1006544522159","volume":"13","author":"MJ Pazzani","year":"1999","unstructured":"Pazzani, M.J.: A framework for collaborative, content-based and demographic filtering. Artif. Intell. Rev. 13(5\u20136), 393\u2013408 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"5_CR22","unstructured":"Pew Research Center: Racial and ethnic composition by religious group (2014). https:\/\/linproxy.fan.workers.dev:443\/https\/www.pewforum.org\/religious-landscape-study\/racial-and-ethnic-composition\/ . Accessed 09 July 2019"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Sapiezynski, P., Zeng, W., Robertson, R.E., Mislove, A., Wilson, C.: Quantifying the impact of user attention on fair group representation in ranked lists. In: Companion Proceedings of the 2019 World Wide Web Conference, WWW 2019, pp. 553\u2013562. ACM (2019)","DOI":"10.1145\/3308560.3317595"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Saxena, N.A., Huang, K., DeFilippis, E., Radanovic, G., Parkes, D.C., Liu, Y.: How do fairness definitions fare?: examining public attitudes towards algorithmic definitions of fairness. In: Proceedings of the 2019 AAAI\/ACM Conference on AI, Ethics, and Society, AIES 2019, pp. 99\u2013106. ACM (2019)","DOI":"10.1145\/3306618.3314248"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Steck, H.: Calibrated recommendations. In: Proceedings of the 12th ACM Conference on Recommender Systems, pp. 154\u2013162. ACM (2018)","DOI":"10.1145\/3240323.3240372"},{"key":"5_CR26","unstructured":"Van Der Zon, S.B.: Predictive performance and discrimination in unbalanced classification. Master\u2019s thesis, TU Eindhoven (2016)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: Proceedings of the International Workshop on Software Fairness, FairWare 2018, pp. 1\u20137. ACM (2018)","DOI":"10.1145\/3194770.3194776"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Xiao, L., Min, Z., Yongfeng, Z., Zhaoquan, G., Yiqun, L., Shaoping, M.: Fairness-aware group recommendation with pareto-efficiency. In: Proceedings of the Eleventh ACM Conference on Recommender Systems, RecSys 2017, pp. 107\u2013115. ACM (2017)","DOI":"10.1145\/3109859.3109887"},{"issue":"1","key":"5_CR29","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/nav.21520","volume":"60","author":"Z Xu","year":"2013","unstructured":"Xu, Z.: The knapsack problem with a minimum filling constraint. Naval Res. Logist. 60(1), 56\u201363 (2013)","journal-title":"Naval Res. Logist."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Yang, K., Stoyanovich, J.: Measuring fairness in ranked outputs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management, pp. 22:1\u201322:6. ACM (2017)","DOI":"10.1145\/3085504.3085526"},{"key":"5_CR31","unstructured":"Yao, S., Huang, B.: New fairness metrics for recommendation that embrace differences. CoRR abs\/1706.09838 (2017). https:\/\/linproxy.fan.workers.dev:443\/http\/arxiv.org\/abs\/1706.09838"},{"key":"5_CR32","doi-asserted-by":"crossref","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, pp. 1569\u20131578. ACM (2017)","DOI":"10.1145\/3132847.3132938"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Dave, T., Mishra, N., Kumar, H.: Fairness in reciprocal recommendations: a speed-dating study. In: Adjunct Publication of the 26th Conference on User Modeling, Adaptation and Personalization, UMAP 2018, pp. 29\u201334. ACM (2018)","DOI":"10.1145\/3213586.3226207"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Hu, X., Caverlee, J.: Fairness-aware tensor-based recommendation. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, pp. 1153\u20131162. ACM (2018)","DOI":"10.1145\/3269206.3271795"}],"container-title":["Communications in Computer and Information Science","Bias and Social Aspects in Search and Recommendation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52485-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T15:10:16Z","timestamp":1616598616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-030-52485-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030524845","9783030524852"],"references-count":34,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-52485-2_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"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":"https:\/\/linproxy.fan.workers.dev:443\/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)"}}]}}