Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

"And the Winner Is...": Dynamic Lotteries for Multi-group Fairness-Aware Recommendation (2009.02590v1)

Published 5 Sep 2020 in cs.IR, cs.AI, and cs.LG

Abstract: As recommender systems are being designed and deployed for an increasing number of socially-consequential applications, it has become important to consider what properties of fairness these systems exhibit. There has been considerable research on recommendation fairness. However, we argue that the previous literature has been based on simple, uniform and often uni-dimensional notions of fairness assumptions that do not recognize the real-world complexities of fairness-aware applications. In this paper, we explicitly represent the design decisions that enter into the trade-off between accuracy and fairness across multiply-defined and intersecting protected groups, supporting multiple fairness metrics. The framework also allows the recommender to adjust its performance based on the historical view of recommendations that have been delivered over a time horizon, dynamically rebalancing between fairness concerns. Within this framework, we formulate lottery-based mechanisms for choosing between fairness concerns, and demonstrate their performance in two recommendation domains.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Nasim Sonboli (10 papers)
  2. Robin Burke (40 papers)
  3. Nicholas Mattei (51 papers)
  4. Farzad Eskandanian (7 papers)
  5. Tian Gao (57 papers)
Citations (12)