TY - GEN
T1 - Learning with Exposure Constraints in Recommendation Systems
AU - Ben-Porat, Omer
AU - Torkan, Rotem
N1 - Publisher Copyright: © 2023 ACM.
PY - 2023/4/30
Y1 - 2023/4/30
N2 - Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers' point of view. Content providers, e.g., vloggers and bloggers, contribute fresh content and rely on user engagement to create revenue and finance their operations. In this work, we propose a contextual multi-armed bandit setting to model the dependency of content providers on exposure. In our model, the system receives a user context in every round and has to select one of the arms. Every arm is a content provider who must receive a minimum number of pulls every fixed time period (e.g., a month) to remain viable in later rounds; otherwise, the arm departs and is no longer available. The system aims to maximize the users' (content consumers) welfare. To that end, it should learn which arms are vital and ensure they remain viable by subsidizing arm pulls if needed. We develop algorithms with sub-linear regret, as well as a lower bound that demonstrates that our algorithms are optimal up to logarithmic factors.
AB - Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers' point of view. Content providers, e.g., vloggers and bloggers, contribute fresh content and rely on user engagement to create revenue and finance their operations. In this work, we propose a contextual multi-armed bandit setting to model the dependency of content providers on exposure. In our model, the system receives a user context in every round and has to select one of the arms. Every arm is a content provider who must receive a minimum number of pulls every fixed time period (e.g., a month) to remain viable in later rounds; otherwise, the arm departs and is no longer available. The system aims to maximize the users' (content consumers) welfare. To that end, it should learn which arms are vital and ensure they remain viable by subsidizing arm pulls if needed. We develop algorithms with sub-linear regret, as well as a lower bound that demonstrates that our algorithms are optimal up to logarithmic factors.
KW - economics and computation
KW - multi-armed bandits
UR - http://www.scopus.com/inward/record.url?scp=85159361644&partnerID=8YFLogxK
U2 - 10.1145/3543507.3583320
DO - 10.1145/3543507.3583320
M3 - منشور من مؤتمر
T3 - ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023
SP - 3456
EP - 3466
BT - ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023
T2 - 32nd ACM World Wide Web Conference, WWW 2023
Y2 - 30 April 2023 through 4 May 2023
ER -