Strategic Linear Contextual Bandits
<|reference_start|>Strategic Linear Contextual Bandits: 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.<|reference_end|>
@article{buening2024strategic,
    title={Strategic Linear Contextual Bandits},
    author={Thomas Kleine Buening, Aadirupa Saha, Christos Dimitrakakis, Haifeng
  Xu},
    journal={arXiv preprint arXiv:2406.00551},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.00551},
    primaryClass={cs.LG cs.GT}
}