Bandits meet mechanism design to combat clickbait in online recommendation

TK Buening, A Saha, C Dimitrakakis, H Xu - arXiv preprint arXiv …, 2023 - arxiv.org
We study a strategic variant of the multi-armed bandit problem, which we coin the strategic
click-bandit. This model is motivated by applications in online recommendation where the …

Contextual Multinomial Logit Bandits with General Value Functions

M Zhang, H Luo - arXiv preprint arXiv:2402.08126, 2024 - arxiv.org
Contextual multinomial logit (MNL) bandits capture many real-world assortment
recommendation problems such as online retailing/advertising. However, prior work has …

Truthful Bandit Mechanisms for Repeated Two-stage Ad Auctions

H Li, Y Liu, Z Zheng, Z Zhang, J Xu, F Wu - Proceedings of the 30th ACM …, 2024 - dl.acm.org
Online advertising platforms leverage a two-stage auction architecture to deliver
personalized ads to users with low latency. The first stage efficiently selects a small subset of …

Online Incentive Protocol Design for Reposting Service in Online Social Networks

H Gu, S Zheng, X Liu, H Xie, JCS Lui - ACM Transactions on the Web, 2024 - dl.acm.org
Reposting plays an essential role in boosting visibility on online social networks (OSNs). In
this paper, we study the problem of designing “reposting service” in an OSN to incentivize …