ranking algorithms are deployed widely to order a set of items in
applications such as search engines, news feeds, and recommendation systems.
Recent studies, however, have shown that, left unchecked, the output of ranking
algorithms can result in decreased diversity in the type of con
提出了一种公正和无偏的排序方法 Maximal Marginal Fairness (MMF),它包含了为关联度和公平性提供无偏估计的算法以及一个明确的控制器,以在前 k 个结果中最大化边际关联度和公平性,理论和实证分析表明,在长列表公平性方面做出了一些小妥协,我们的方法在前 k 个排名中的相关性和公平性方面,都优于现有的、最先进的算法。