{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:46Z","timestamp":1742913886245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031333736"},{"type":"electronic","value":"9783031333743"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33374-3_43","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"544-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness for\u00a0Robust Learning to\u00a0Rank"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3536-4567","authenticated-orcid":false,"given":"Omid","family":"Memarrast","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4711-9047","authenticated-orcid":false,"given":"Ashkan","family":"Rezaei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1538-9090","authenticated-orcid":false,"given":"Rizal","family":"Fathony","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4041-6871","authenticated-orcid":false,"given":"Brian","family":"Ziebart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Beutel, A., et al.: Fairness in recommendation ranking through pairwise comparisons. In: ACM SIGKDD International Conference on Knowledge Discovery & Data Mining(KDD), pp. 2212\u20132220 (2019)","DOI":"10.1145\/3292500.3330745"},{"key":"43_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 and Development in Information Retrieval, pp. 405\u2013414 (2018)","DOI":"10.1145\/3209978.3210063"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers Inc (2011)","DOI":"10.1561\/9781601984616"},{"issue":"5","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129\u2013136 (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Celis, L.E., Mehrotra, A., Vishnoi, N.K.: Interventions for ranking in the presence of implicit bias. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 369\u2013380 (2020)","DOI":"10.1145\/3351095.3372858"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66(3) (2016)","DOI":"10.1007\/s10915-015-0048-x"},{"key":"43_CR8","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Diaz, F., Mitra, B., Ekstrand, M.D., Biega, A.J., Carterette, B.: Evaluating stochastic rankings with expected exposure. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 275\u2013284 (2020)","DOI":"10.1145\/3340531.3411962"},{"key":"43_CR10","unstructured":"Eckhouse, L.: Big data may be reinforcing racial bias in the criminal justice system. The Washington Post (2017)"},{"key":"43_CR11","unstructured":"Fathony, R., Liu, A., Asif, K., Ziebart, B.: Adversarial multiclass classification: A risk minimization perspective. In: NeurIPS (2016)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Dutt, R., Wilson, C.: When fair ranking meets uncertain inference. arXiv preprint arXiv:2105.02091 (2021)","DOI":"10.1145\/3506803"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.D., Dawid, A.P.: Game theory, maximum entropy, minimum discrepancy, and robust Bayesian decision theory. Ann. Stat. 32, 1367\u20131433 (2004)","DOI":"10.1214\/009053604000000553"},{"issue":"4","key":"43_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inform. Syst. (TOIS) 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inform. Syst. (TOIS)"},{"key":"43_CR15","unstructured":"Kallus, N., Zhou, A.: The fairness of risk scores beyond classification: Bipartite ranking and the xauc metric. In: Advances in Neural Information Processing Systems, pp. 3438\u20133448 (2019)"},{"key":"43_CR16","unstructured":"Kleinberg, J., Raghavan, M.: Selection problems in the presence of implicit bias. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) (2018)"},{"issue":"1\u20132","key":"43_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"43_CR18","unstructured":"Larson, J., Mattu, S., Kirchner, L., Angwin, J.: How we analyzed the compas recidivism algorithm. ProPublica 9 (2016)"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Mehrotra, A., Celis, L.E.: Mitigating bias in set selection with noisy protected attributes. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 237\u2013248 (2021)","DOI":"10.1145\/3442188.3445887"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Narasimhan, H., Cotter, A., Gupta, M., Wang, S.: Pairwise fairness for ranking and regression. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 5248\u20135255 (2020)","DOI":"10.1609\/aaai.v34i04.5970"},{"key":"43_CR21","unstructured":"O\u2019Neil, C.: Weapons of math destruction: How big data increases inequality and threatens democracy. Broadway Books (2016)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Prost, F., et al.: Measuring model fairness under noisy covariates: A theoretical perspective. arXiv preprint arXiv:2105.09985 (2021)","DOI":"10.1145\/3461702.3462603"},{"key":"43_CR23","unstructured":"Qin, T., Liu, T.Y.: Introducing letor 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Rezaei, A., Fathony, R., Memarrast, O., Ziebart, B.: Fairness for robust log loss classification. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 5511\u20135518 (2020)","DOI":"10.1609\/aaai.v34i04.6002"},{"key":"43_CR25","doi-asserted-by":"crossref","unstructured":"Rezaei, A., Liu, A., Memarrast, O., Ziebart, B.D.: Robust fairness under covariate shift. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 9419\u20139427 (2021)","DOI":"10.1609\/aaai.v35i11.17135"},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"Robertson, S.E.: The probability ranking principle in ir. J. Document. 33(4), 294\u2013304 (1977)","DOI":"10.1108\/eb026647"},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Singh, A., Joachims, T.: Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2219\u20132228. ACM (2018)","DOI":"10.1145\/3219819.3220088"},{"key":"43_CR28","first-page":"5426","volume":"32","author":"A Singh","year":"2019","unstructured":"Singh, A., Joachims, T.: Policy learning for fairness in ranking. Adv. Neural. Inf. Process. Syst. 32, 5426\u20135436 (2019)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"43_CR29","unstructured":"Singh, A., Kempe, D., Joachims, T.: Fairness in ranking under uncertainty. In: Advances in Neural Information Processing Systems, p. 34 (2021)"},{"key":"43_CR30","doi-asserted-by":"crossref","unstructured":"Yadav, H., Du, Z., Joachims, T.: Policy-gradient training of fair and unbiased ranking functions. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1044\u20131053 (2021)","DOI":"10.1145\/3404835.3462953"},{"key":"43_CR31","doi-asserted-by":"crossref","unstructured":"Zehlike, M., Castillo, C.: Reducing disparate exposure in ranking: A learning to rank approach. In: Proceedings of The Web Conference 2020, pp. 2849\u20132855 (2020)","DOI":"10.1145\/3366424.3380048"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33374-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:05:40Z","timestamp":1710360340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33374-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333736","9783031333743"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33374-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"813","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":"143","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":"0","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":"18% - 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.5","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":"10","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}