Evaluating Stochastic Rankings with Expected Exposure

@article{Diaz2020EvaluatingSR,
  title={Evaluating Stochastic Rankings with Expected Exposure},
  author={Fernando Diaz and Bhaskar Mitra and Michael D. Ekstrand and Asia J. Biega and Ben Carterette},
  journal={Proceedings of the 29th ACM International Conference on Information \& Knowledge Management},
  year={2020}
}
We introduce the concept of expected exposure as the average attention ranked items receive from users over repeated samples of the same query. Furthermore, we advocate for the adoption of the principle of equal expected exposure: given a fixed information need, no item should receive more or less expected exposure than any other item of the same relevance grade. We argue that this principle is desirable for many retrieval objectives and scenarios, including topical diversity and fair ranking… Expand
Comparing Fair Ranking Metrics
Neural Methods for Effective, Efficient, and Exposure-Aware Information Retrieval
Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness
Estimation of Fair Ranking Metrics with Incomplete Judgments
FAIR: Fairness-Aware Information Retrieval Evaluation
Naver Labs Europe at TREC 2020 Fair Ranking Track
Fairness and Discrimination in Information Access Systems
Multi-FR: A Multi-Objective Optimization Method for Achieving Two-sided Fairness in E-commerce Recommendation
...
1
2
3
...

References

SHOWING 1-3 OF 3 REFERENCES
BPR: Bayesian Personalized Ranking from Implicit Feedback
Policy Learning for Fairness in Ranking
Fast als-based matrix factorization for explicit and implicit feedback datasets