The following publications are possibly variants of this publication:
- Bandits with concave rewards and convex knapsacksShipra Agrawal, Nikhil R. Devanur. sigecom 2014: 989-1006 [doi]
- Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithmsLihong Li, Wei Chu, John Langford, Xuanhui Wang. wsdm 2011: 297-306 [doi]
- Linear Contextual Bandits with KnapsacksShipra Agrawal, Nikhil R. Devanur. nips 2016: 3450-3458 [doi]
- Contextual Bandits with Knapsacks for a Conversion ModelZhen Li, Gilles Stoltz. nips 2022: [doi]
- An Efficient Extension of Earley s Algorithm for Parsing Multidimensional StructuresXu Hongxia, Zhang Li. csse 2008: 780-783 [doi]
- Contextual User Browsing Bandits for Large-Scale Online Mobile RecommendationXu He, Bo An 0001, Yanghua Li, Haikai Chen, Qingyu Guo, Xin Li, Zhirong Wang. recsys 2020: 63-72 [doi]
- An Efficient Algorithm for Deep Stochastic Contextual BanditsTan Zhu, Guannan Liang, Chunjiang Zhu, HaiNing Li, Jinbo Bi. AAAI 2021: 11193-11201 [doi]