Fairness of Exposure in Rankings

被引:321
作者
Singh, Ashudeep [1 ]
Joachims, Thorsten [1 ]
机构
[1] Cornell Univ, Ithaca, NY 14850 USA
来源
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING | 2018年
关键词
fairness in rankings; fairness; algorithmic bias; position bias; equal opportunity; DECOMPOSITION; BIRKHOFF; POLITICS; SEARCH;
D O I
10.1145/3219819.3220088
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Rankings are ubiquitous in the online world today. As we have transitioned from finding books in libraries to ranking products, jobs, job applicants, opinions and potential romantic partners, there is a substantial precedent that ranking systems have a responsibility not only to their users but also to the items being ranked. To address these often conflicting responsibilities, we propose a conceptual and computational framework that allows the formulation of fairness constraints on rankings in terms of exposure allocation. As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while provably satisfying a specifiable notion of fairness. Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented using our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints. We illustrate the effect of these constraints by providing empirical results on two ranking problems.
引用
收藏
页码:2219 / 2228
页数:10
相关论文
共 37 条
[1]  
[Anonymous], THESIS
[2]  
[Anonymous], 2017, NY TIMES
[3]  
[Anonymous], FATML WORKSH ICML
[4]  
[Anonymous], 1959, The Quarterly Journal of Mathematics
[5]  
[Anonymous], 2013, INT C MACH LEARN
[6]  
[Anonymous], ARXIV171209752
[7]  
[Anonymous], 2008, International Conference on Machine Learning (ICML)
[8]  
[Anonymous], 2011, NEW YORK LAW SCH LEG
[9]  
[Anonymous], 2017, CIKM
[10]  
[Anonymous], 2007, P 16 INT C WORLD WID, DOI DOI 10.1145/1242572.1242643