TY - GEN
T1 - Equality of voice
T2 - 2019 ACM Conference on Fairness, Accountability, and Transparency, FAT* 2019
AU - Chakraborty, Abhijnan
AU - Patro, Gourab K.
AU - Ganguly, Niloy
AU - Gummadi, Krishna P.
AU - Loiseau, Patrick
N1 - Publisher Copyright:
© 2019 Association for Computing Machinery.
PY - 2019/1/29
Y1 - 2019/1/29
N2 - To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories), which rely on crowdsourced popularity signals to select the items. However, diferent sections of a crowd may have diferent preferences, and there is a large silent majority who do not explicitly express their opinion. Also, the crowd often consists of actors like bots, spammers, or people running orchestrated campaigns. Recommendation algorithms today largely do not consider such nuances, hence are vulnerable to strategic manipulation by small but hyper-active user groups. To fairly aggregate the preferences of all users while recommending top-K items, we borrow ideas from prior research on social choice theory, and identify a voting mechanism called Single Transferable Vote (STV) as having many of the fairness properties we desire in top-K item (s)elections. We develop an innovative mechanism to attribute preferences of silent majority which also make STV completely operational. We show the generalizability of our approach by implementing it on two diferent real-world datasets. Through extensive experimentation and comparison with state-of-the-art techniques, we show that our proposed approach provides maximum user satisfaction, and cuts down drastically on items disliked by most but hyper-actively promoted by a few users.
AB - To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories), which rely on crowdsourced popularity signals to select the items. However, diferent sections of a crowd may have diferent preferences, and there is a large silent majority who do not explicitly express their opinion. Also, the crowd often consists of actors like bots, spammers, or people running orchestrated campaigns. Recommendation algorithms today largely do not consider such nuances, hence are vulnerable to strategic manipulation by small but hyper-active user groups. To fairly aggregate the preferences of all users while recommending top-K items, we borrow ideas from prior research on social choice theory, and identify a voting mechanism called Single Transferable Vote (STV) as having many of the fairness properties we desire in top-K item (s)elections. We develop an innovative mechanism to attribute preferences of silent majority which also make STV completely operational. We show the generalizability of our approach by implementing it on two diferent real-world datasets. Through extensive experimentation and comparison with state-of-the-art techniques, we show that our proposed approach provides maximum user satisfaction, and cuts down drastically on items disliked by most but hyper-actively promoted by a few users.
KW - Fair Representation
KW - Fairness in Recommendation
KW - Most Popular News
KW - Top-K Recommendation
KW - Twitter Trends
U2 - 10.1145/3287560.3287570
DO - 10.1145/3287560.3287570
M3 - Conference contribution
AN - SCOPUS:85061826247
T3 - FAT* 2019 - Proceedings of the 2019 Conference on Fairness, Accountability, and Transparency
SP - 129
EP - 138
BT - FAT* 2019 - Proceedings of the 2019 Conference on Fairness, Accountability, and Transparency
PB - Association for Computing Machinery, Inc
Y2 - 29 January 2019 through 31 January 2019
ER -