Journal Articles
Regret Minimization with Dynamic Benchmarks in Repeated Games.
Under review. With Ludovico Crippa and Bar Light.
Leveraging Consensus Effect to Optimize Ranking in Online Discussion Boards.
Under review. With Gad Allon and Joseph Carlstein.
Information Disclosure and Promotion Policy Design for Platforms.
Management Science (forthcoming). With Gregory Macnamara, Ilan Morgenstern, and Daniela Saban.
Smoothness-Adaptive Contextual Bandits.
Operations Research, 2022, 70 (6) 3198–3216. With Ahmadreza Momeni and Stefan Wager.
- honorable mention at INFORMS 2020 Nicholson student paper award (A. Momeni)
Adaptive Sequential Experiments with Unknown Information Arrival Processes.
M&SOM, 2022, 24 (5), 2666-2684. With Ahmadreza Momeni.
- finalist of INFORMS Applied Probability Society 2018 student paper award (A. Momeni)
Sequential Procurement with Contractual and Experimental Learning.
Management Science, 2022, 68 (4), 2714-2731. With Gregory Macnamara and Daniela Saban.
- finalist of INFORMS Revenue Management & Pricing Section 2019 student paper award (G. Macnamara)
Value Loss in Allocation Systems with Provider Guarantees.
Management Science, 2021, 67 (6), 3757-3784. With Dan A. Iancu and Xavier Warnes.
Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-Stationary Rewards.
Stochastic Systems, 2019, 9 (4), 319-337. With Omar Besbes and Assaf Zeevi.
- part of a series of papers recognized by the 2019 Lanchester Prize
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium.
Management Science, 2019, 65 (9), 3952-3968. With Santiago R. Balseiro.
- featured article with associated entry in Management Science Review
- honorable mention at the INFORMS 2018 Junior Faculty Interest Group (JFIG) paper award
- featured in Insights by Stanford Business
The Competitive Facility Location Problem for a Duopoly: Advances Beyond Trees.
Operations Research, 2018, 66 (4), 1058-1067. With Daniela Saban and Nicolas E. Stier-Moses.
- online companion available here
Framework Agreements in Procurement: An Auction Model and Design Recommendations.
M&SOM, 2017, 19 (4), 586-603. With Lijian Lu and Gabriel Y. Weintraub.
Optimization in Online Content Recommendation Services: Beyond Click-Through Rates.
M&SOM, 2016, 18 (1), 15-33. With Omar Besbes and Assaf Zeevi.
- lead article of the special issue on practice focused research
- first place at the 2014 M&SOM student paper award
- featured in M&SOM Review and in Insights by Stanford Business
- online companion available here
Non-Stationary Stochastic Optimization.
Operations Research, 2015, 63 (5), 1227-1244. With Omar Besbes and Assaf Zeevi.
- part of a series of papers recognized by the 2019 Lanchester Prize
- honorable mention at INFORMS 2013 Nicholson student paper award
- online companion available here
Peer-Reviewed Conference Publications (Partial List)
Confounding Equilibria for Platforms with Private Information on Promotion Value.
Proceeding of the 17th Conference on Web and Internet Economics (WINE 2021), M. Feldman, H. Fu, and I. Talgam-Cohen (editors). With Gregory Macnamara, Ilan Morgenstern, and Daniela Saban.
Adaptive Learning with Unknown Information Flows.
Advances in Neural Information Processing Systems 31 (NeurIPS 2018), S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (editors), 7473-7482. With Ahmadreza Momeni.
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium.
Proceeding of the 18th ACM Conference on Economics and Computation (EC 2017). With Santiago R. Balseiro.
Stochastic Multi-Armed Bandit Problem with Non-stationary Rewards.
Advances in Neural Information Processing Systems 27 (NIPS 2014), Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger (editors), 199-207. With Omar Besbes and Assaf Zeevi.
A facility Location Problem Under Competition.
Proceedings of the 6th Workshop on the Economics of Networks, Systems & Computation (NetEcon 2011), J. Douceur and A. Ozdaglar (editors). With Nicolas E. Stier-Moses.