Proceedings of the 2019 International Conference on Management of Data 2019
DOI: 10.1145/3299869.3300079
|View full text |Cite
|
Sign up to set email alerts
|

Designing Fair Ranking Schemes

Abstract: Items from a database are often ranked based on a combination of multiple criteria. A user may have the flexibility to accept combinations that weigh these criteria differently, within limits. On the other hand, this choice of weights can greatly affect the fairness of the produced ranking. In this paper, we develop a system that helps users choose criterion weights that lead to greater fairness.We consider ranking functions that compute the score of each item as a weighted sum of (numeric) attribute values, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
96
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 137 publications
(96 citation statements)
references
References 38 publications
(63 reference statements)
0
96
0
Order By: Relevance
“…[12]). • Modifying the training process to generate a bias-free model (e.g., [5]). • Post-processing includes the modification of the results of a trained machine learning model, using techniques such as calibration of regression or classification output and reranking of results (e.g., [42]).…”
Section: Lessons Learned In Practicementioning
confidence: 99%
See 1 more Smart Citation
“…[12]). • Modifying the training process to generate a bias-free model (e.g., [5]). • Post-processing includes the modification of the results of a trained machine learning model, using techniques such as calibration of regression or classification output and reranking of results (e.g., [42]).…”
Section: Lessons Learned In Practicementioning
confidence: 99%
“…A method to assist the algorithm designer to generate a fair linear ranking model has been proposed in [5]. With respect to a fixed set of items, given a weight vector for ranking, the method in [5] computes a similar vector that meets fairness requirements. This approach is not applicable in our setting since it assumes that the candidate set of items to be ranked is fixed, whereas this set depends on the query in our case.…”
Section: Related Workmentioning
confidence: 99%
“…In fair ranking, early studies mainly focused on quantifying the discrimination with proposed ranking measures in the top-k list [32], or indirect discrimination [43]. Recently, fair ranking methods have been proposed [2,41,23]. Asudeh et al [2] scored items based on a set of desired attribute weights to achieve fairness.…”
Section: Fair Rankingmentioning
confidence: 99%
“…Recently, fair ranking methods have been proposed [2,41,23]. Asudeh et al [2] scored items based on a set of desired attribute weights to achieve fairness. On the other hand, Karako and…”
Section: Fair Rankingmentioning
confidence: 99%
“…Since both lines intersect with the ray of f at the same point, f assigns an equal score to ti and tj. We refer to this function (and its ray) as the ordering exchange (first defined in [13]) between ti and tj, and denote it ×t i ,t j . The ordering between ti and tj changes on two sides of ×t i ,t j : ti is ranked higher than tj one side of the ray, and tj is ranked higher than ti on the other side.…”
Section: Two Dimensional (2d) Rankingmentioning
confidence: 99%