Varun Gupta studies stochastic modeling and optimization, applied probability, algorithm design and analysis, and mechanism design. He is particularly interested in modeling and optimization of resource allocation policies for multi-server and distributed systems (e.g., cloud infrastructure, health care, smart grids) from a queueing theoretic perspective.
Gupta holds a PhD in computer science from Carnegie Mellon University. He completed his undergraduate studies in computer science and engineering at the Indian Institute of Technology in Delhi where he was awarded the President's Gold Medal.
Outside of academia Gupta has corporate experience as a research intern at Bell Laboratories, Alcatel-Lucent and Microsoft Research Ltd. Additionally, during 2011-12 he was a post-doctoral researcher at Google Research, New York.
2017 - 2018 Course Schedule
||Managerial Decision Modeling
||Special Topics in Operations Mgt./Mgt. Sci.
Cooking, squash, British comedies.
With A. Radovanovic, “Asymptotically optimal online stochastic bin packing,” (Working paper).
With L. Yang, L. Debo, "Trading time in a congested environment," (Working paper).
With J. Zhang,"Diffusion approximation and optimal control for state-dependent limited processor sharing queues," (Working paper).
With A. Busic, J. Mairess, "Stability of the bipartite matching model," Advances in Applied Probability (2013)
With T. Osogami, “On Markov-Krein characterization of the mean waiting time in M/G/k and other queueing systems,” Queueing Systems (2011).
With J. Dai, M. Harchol-Balter, B. Zwart, “On the inapproximabitlity of M/G/k: Why two moments of job size distribution are not enough,” Queueing Systems (2007)