1. Yasin Abbasi-yadkori Dávid Pál and Csaba Szepesvári. 2011. Improved Algorithms for Linear Stochastic Bandits. In NIPS. 2312–2320. Yasin Abbasi-yadkori Dávid Pál and Csaba Szepesvári. 2011. Improved Algorithms for Linear Stochastic Bandits. In NIPS. 2312–2320.
2. Marc Abeille and Alessandro Lazaric. 2017. Linear thompson sampling revisited. In Artificial Intelligence and Statistics. PMLR 176–184. Marc Abeille and Alessandro Lazaric. 2017. Linear thompson sampling revisited. In Artificial Intelligence and Statistics. PMLR 176–184.
3. Priyank Agrawal and Theja Tulabandhula . 2020. Incentivising Exploration and Recommendations for Contextual Bandits with Payments . In Multi-Agent Systems and Agreement Technologies . Springer , 159–170. Priyank Agrawal and Theja Tulabandhula. 2020. Incentivising Exploration and Recommendations for Contextual Bandits with Payments. In Multi-Agent Systems and Agreement Technologies. Springer, 159–170.
4. Shipra Agrawal and Navin Goyal . 2013 . Thompson sampling for contextual bandits with linear payoffs . In International Conference on Machine Learning. PMLR, 127–135 . Shipra Agrawal and Navin Goyal. 2013. Thompson sampling for contextual bandits with linear payoffs. In International Conference on Machine Learning. PMLR, 127–135.
5. Using Confidence Bounds for Exploitation-Exploration Trade-offs;Auer Peter;Journal of Machine Learning Research,2002