Artigos com autorizações de acesso público - Shipra AgrawalSaiba mais
1 artigo não disponível publicamente
Bandits with global convex constraints and objective
S Agrawal, NR Devanur
Operations Research 67 (5), 1486-1502, 2019
Autorizações: US National Science Foundation
7 artigos disponíveis publicamente
A dynamic near-optimal algorithm for online linear programming
S Agrawal, Z Wang, Y Ye
Operations Research 62 (4), 876-890, 2014
Autorizações: National Natural Science Foundation of China
A near-optimal exploration-exploitation approach for assortment selection
S Agrawal, V Avadhanula, V Goyal, A Zeevi
Proceedings of the 2016 ACM Conference on Economics and Computation, 599-600, 2016
Autorizações: US National Science Foundation
Bandits with delayed, aggregated anonymous feedback
C Pike-Burke, S Agrawal, C Szepesvari, S Grunewalder
International Conference on Machine Learning, 4105-4113, 2018
Autorizações: UK Engineering and Physical Sciences Research Council
On optimal ordering in the optimal stopping problem
S Agrawal, J Sethuraman, X Zhang
Proceedings of the 21st ACM Conference on Economics and Computation, 187-188, 2020
Autorizações: US National Science Foundation
Dynamic pricing and learning under the bass model
S Agrawal, S Yin, A Zeevi
Proceedings of the 22nd ACM Conference on Economics and Computation, 2-3, 2021
Autorizações: US National Science Foundation
Spectral bandits
T Kocák, R Munos, B Kveton, S Agrawal, M Valko
Journal of Machine Learning Research 21 (218), 1-44, 2020
Autorizações: European Commission, Agence Nationale de la Recherche
Online allocation and learning in the presence of strategic agents
S Yin, S Agrawal, A Zeevi
Advances in Neural Information Processing Systems 35, 6333-6344, 2022
Autorizações: US National Science Foundation
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador