Research

Indexed pages:          Google Scholar          DBLP          Semantic Scholar

Working papers

1. Wenqian Xing, Yue Hu, A.K., and Vahid Sarhangian, "Online Learning for Dynamic Service Mode Control," Major Revision at Operations Research.      [link] 

Accepted/published papers

1. A.K. and Divya Singhvi, "Online Learning for Repeated Nudging," accepted at ACM Conference on Economics and Computation (EC), 2025.      [link]

2. Yonatan Gur, A.K., and Aleksandrs Slivkins, "Incentivized Exploration via Filtered Posterior Sampling," ACM Conference on Economics and Computation (EC), 2024.      [link]

1. • Extended abstract appeared in the proceedings of EC'24.

3. A.K. and Assaf Zeevi, "Complexity Analysis of a Countable-armed Bandit Problem," International Conference on Algorithmic Learning Theory (ALT), 2023.     [link]    

4. A.K. and Assaf Zeevi, "Dynamic Learning in Large Matching Markets," NeurIPS, 2022.     [link]    

1. • Extended abstract appeared in ACM SIGMETRICS Performance Evaluation Review 50 (2).     [link]  

   • Spotlight talk, INFORMS Revenue Management and Pricing Conference 2022.

   • Finalist, INFORMS (Revenue Management and Pricing section) Jeff McGill Student Paper Competition 2022.

   • Finalist, INFORMS Service Science Best Cluster Paper Award 2022. 

5. A.K. and Assaf Zeevi, "Bandits with Dynamic Arm-acquisition Costs," Allerton Conference on Communication, Control, and Computing, 2022.     [link] 

2. A.K. and Assaf Zeevi, "A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms," NeurIPS, 2021.     [link]     

• Spotlight paper (top 3% of submissions), NeurIPS 2021.     

• Finalist, INFORMS Applied Probability Society Best Student Paper Competition 2022.

3. A.K. and Assaf Zeevi, "From Finite to Countable-armed Bandits," NeurIPS, 2020.     [link]    

4. A.K., Vivek Borkar and Nikhil Karamchandani, "Stochastic Approximation Algorithms for Rumor Source Inference on Graphs," Performance Evaluation, Aug. 2019.     [link]     

   • Preliminary work was adjudged Finalist, Best Paper Award at VALUETOOLS, 2017.     [link]

5. A.K., Saurabh Pinjani, Gaurav Kasbekar, D. Manjunath and Jayakrishnan Nair, "Capacity Expansion of Neutral ISPs via Content Provider Participation: The Bargaining Edge," Performance Evaluation, May 2019.     [link]     

   • Preliminary work appeared in VALUETOOLS, 2017.     [link]

Talks

1. Posterior Sampling for Incentive-Compatible Refugee Assignment

   • Immigration Policy Lab (Stanford/ETH-Zurich) Research Roundtable (November 2024).

   • INFORMS Annual Meeting 2024.

2. Online Learning for Repeated Nudging

   • ACM Conference on Economics and Computation (EC) 2025.

   • INFORMS APS Conference 2025.

   • Marketplace Innovation Workshop 2025. 

   • Meta Applied Reinforcement Learning Research Seminar (April 2025).

   • POMS Annual Conference 2024.

3. Incentivized Exploration via Filtered Posterior Sampling

   • INFORMS APS Conference 2025.

   • India Management Research Conference 2024. 

   • INFORMS Annual Meeting 2024.

   • Market Design Seminar, Stanford Economics (October 2024).

   • Netflix Research Seminar (September 2024).

   • ESIF Economics and AI+ML Meeting 2024.

   • INFORMS Revenue Management and Pricing Conference 2024. 

   • ACM Conference on Economics and Computation (EC) 2024.

   • INFORMS MSOM Conference 2024.

   • Marketplace Innovation Workshop 2024.

   • POMS Annual Conference 2024.

4. Complexity Analysis of a Countable-armed Bandit Problem

   • INFORMS Annual Meeting 2023.

   • INFORMS Revenue Management and Pricing Conference 2023.

   • International Conference on Algorithmic Learning Theory 2023. 

5. Bandits with Dynamic Arm-acquisition Costs

   • Allerton Conference on Communication, Control, and Computing 2022.

6. Dynamic Learning in Large Matching Markets

   • Indian School of Business, Hyderabad, India (November 2022).

   • INFORMS Annual Meeting 2022.

   • INFORMS Workshop on Market Design at the ACM Conference on Economics and Computation 2022.

   • INFORMS MSOM Conference 2022.

   • INFORMS Revenue Management and Pricing Conference 2022.

   • Mathematical Performance Modeling & Analysis Workshop at ACM SIGMETRICS (IFIP Performance) 2022.  

7. A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms

   • INFORMS Annual Meeting 2023.

   • INFORMS APS Conference 2023.

   • INFORMS MSOM Conference 2023.

   • INFORMS Annual Meeting 2022.

   • YoungStatS webinar: Theory and Methods for Inference in Multi-armed Bandit Problems.          [Youtube link]

   • INFORMS Annual Meeting 2021.

8. From Finite to Countable-armed Bandits

   • INFORMS Annual Meeting 2020.

9. MCMC Approaches to Rumor Source Inference using Pairwise Information

   • EAI Valuetools 2017.

10. Capacity Expansion of Neutral ISPs via Content Peering Charges: The Bargaining Edge

    • EAI Valuetools 2017.