Skip to yearly menu bar Skip to main content


Poster

Strategic Linear Contextual Bandits

Thomas Kleine Buening · Aadirupa Saha · Christos Dimitrakakis · Haifeng Xu

[ ]
Fri 13 Dec 11 a.m. PST — 2 p.m. PST

Abstract:

Motivated by the phenomenon of strategic agents gaming a recommender system to maximize the number of times they are recommended to users, we study a strategic variant of the linear contextual bandit problem, where the arms can strategically misreport privately observed contexts to the learner. We treat the algorithm design problem as one of mechanism design under uncertainty and propose the Optimistic Grim Trigger Mechanism (OptGTM) that incentivizes the agents (i.e., arms) to report their contexts truthfully while simultaneously minimizing regret. We also show that failing to account for the strategic nature of the agents results in linear regret. However, a trade-off between mechanism design and regret minimization appears to be unavoidable. More broadly, this work aims to provide insight into the intersection of online learning and mechanism design.

Live content is unavailable. Log in and register to view live content