MCMC Approaches to Rumor Source Inference using Pairwise Information. - Anand Kalvit; Vivek S. Borkar; Nikhil Karamchandani (VALUETOOLS, 2017)

Capacity Expansion of Neutral ISPs via Content Peering Charges: The Bargaining Edge. - Anand Kalvit; Gaurav S. Kasbekar; D. Manjunath; Jayakrishnan Nair 001 (VALUETOOLS, 2017)

Stochastic approximation algorithms for rumor source inference on graphs. - Anand Kalvit; Vivek S. Borkar; Nikhil Karamchandani (Perform. Evaluation, 2019)

Capacity expansion of neutral ISPs via content provider participation: The bargaining edge. - Anand Kalvit; Saurabh Pinjani; Gaurav S. Kasbekar; D. Manjunath; Jayakrishnan Nair 001 (Perform. Evaluation, 2019)

From Finite to Countable-Armed Bandits. - Anand Kalvit; Assaf Zeevi (NeurIPS, 2020)

A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms. - Anand Kalvit; Assaf Zeevi (NeurIPS, 2021)

The Countable-armed Bandit with Vanishing Arms. - Anand Kalvit; Assaf Zeevi (CoRR, 2021)

Bandits with Dynamic Arm-acquisition Costs*. - Anand Kalvit; Assaf Zeevi (Allerton, 2022)

Dynamic Learning in Large Matching Markets. - Anand Kalvit; Assaf Zeevi (SIGMETRICS Perform. Evaluation Rev., 2022)

Complexity Analysis of a Countable-armed Bandit Problem. - Anand Kalvit; Assaf Zeevi (ALT, 2023)

Incentivized Exploration via Filtered Posterior Sampling. - Yonatan Gur; Anand Kalvit; Aleksandrs Slivkins (EC, 2024)

Online Learning for Repeated Nudging. - Anand Kalvit; Divya Singhvi (EC, 2025)