| A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms A Kalvit, A Zeevi Advances in Neural Information Processing Systems 34, 8807-8819, 2021 | 38 | 2021 |
| From Finite to Countable-armed Bandits A Kalvit, A Zeevi Advances in Neural Information Processing Systems 33, 8259-8269, 2020 | 13 | 2020 |
| Stochastic approximation algorithms for rumor source inference on graphs A Kalvit, VS Borkar, N Karamchandani Performance Evaluation 132, 1-20, 2019 | 9 | 2019 |
| Dynamic learning in large matching markets A Kalvit, A Zeevi Advances in Neural Information Processing Systems 35, 20770-20781, 2022 | 5 | 2022 |
| Capacity expansion of neutral ISPs via content provider participation: The bargaining edge A Kalvit, S Pinjani, G Kasbekar, D Manjunath, J Nair Performance Evaluation 133, 43-56, 2019 | 4 | 2019 |
| Capacity expansion of neutral ISPs via content peering charges: The bargaining edge A Kalvit, G Kasbekar, D Manjunath, J Nair Proceedings of the 11th EAI International Conference on Performance …, 2017 | 4 | 2017 |
| Complexity Analysis of a Countable-armed Bandit Problem A Kalvit, A Zeevi 34th International Conference on Algorithmic Learning Theory (ALT 2023), 2023 | 2 | 2023 |
| Bandits with Dynamic Arm-acquisition Costs A Kalvit, A Zeevi 58th Annual Allerton Conference on Communication, Control, and Computing …, 2022 | 2 | 2022 |
| Incentivized Exploration via Filtered Posterior Sampling Y Gur, A Kalvit, A Slivkins Proceedings of the 25th ACM Conference on Economics and Computation, 1200-1200, 2024 | 1* | 2024 |
| Improved Asymptotics for Multi-armed Bandit Experiments under Optimism-based Policies: Theory and Applications A Kalvit Columbia University, 2023 | | 2023 |
| MCMC Approaches to Rumor Source Inference using Pairwise Information A Kalvit, VS Borkar, N Karamchandani Proceedings of the 11th EAI International Conference on Performance …, 2017 | | 2017 |
assaf zeeviColumbia universityDirección de correo verificada de gsb.columbia.edu