Nikhil R. Devanur

Nikhil R. Devanur
Name	Nikhil R. Devanur
Nationality	Indian-American
Fields	Computer Science, Operations Research, Game Theory, Probability
Workplaces	Microsoft Research, Yale University, Columbia University, University of Texas at Austin
Alma mater	Indian Institute of Technology Bombay, Georgia Institute of Technology
Doctoral advisor	Michael J. Neely

Nikhil R. Devanur is a researcher in theoretical computer science and applied probability whose work spans algorithmic game theory, market design, stochastic networks, and mechanism design. He has held positions in academic and industrial research settings and contributed to the development of algorithms for matching markets, online allocation, and stochastic optimization. His publications and collaborations link him to a broad network of scholars and institutions across North America, Europe, and Asia.

Early life and education

Devanur was born and raised in India and completed undergraduate studies at Indian Institute of Technology Bombay before pursuing graduate study in the United States at Georgia Institute of Technology. At Georgia Tech he worked under the supervision of Michael J. Neely and completed a doctoral thesis that connected ideas from queueing theory, Markov chains, and algorithmic mechanism design to problems in online allocation. During his formative years he was influenced by research emanating from institutions such as Massachusetts Institute of Technology, Stanford University, Princeton University, University of California, Berkeley, and Carnegie Mellon University.

Academic career and appointments

Devanur has held appointments and visiting positions at a range of universities and research labs including affiliations with Yale University, Columbia University, and the University of Texas at Austin, and a research scientist role at Microsoft Research. He has taught courses drawing on material from the curricula of Harvard University, California Institute of Technology, Cornell University, and University of Illinois at Urbana–Champaign, and collaborated with scholars from University of Washington, University of Pennsylvania, New York University, University of Chicago, and Brown University. His academic network includes joint work with researchers affiliated with Bell Labs, IBM Research, Google Research, and Amazon Web Services.

Research contributions

Devanur's research contributions center on algorithmic approaches to markets and networks, including seminal work on algorithms for matching markets influenced by the traditions of Lloyd Shapley and Alvin E. Roth in the study of stable matching and market design. He has developed algorithmic characterizations related to the Vickrey–Clarke–Groves framework and to incentive-compatible allocation mechanisms as studied in the literature associated with Tim Roughgarden and Éva Tardos. His work on online stochastic allocation builds on foundations laid by researchers at INRIA, Microsoft Research Cambridge, and Bell Labs, connecting to concepts from Markov decision processes and the study of randomized algorithms advanced at Princeton University and Stanford University.

In mechanism design and auction theory, Devanur has contributed to understanding equilibrium computation and incentive compatibility in markets akin to problems examined by Paul Milgrom, Robert B. Wilson, and Timothy F. Bresnahan. His research on resource allocation for stochastic networks relates to queueing models analyzed by scholars at Columbia University and University of California, San Diego, and ties into work on load balancing and scheduling by researchers at ETH Zurich and Technical University of Munich. Devanur's cross-disciplinary projects have involved collaborations with economists from Massachusetts Institute of Technology and University of Chicago and computer scientists from Carnegie Mellon University and University of Toronto.

Devanur has also investigated learning in games and online markets, intersecting with research streams originating at New York University and University of California, Los Angeles, and contributed to algorithmic tools employed in applied settings at Airbnb, Uber, eBay, and LinkedIn through collaborations and industry placements. His theoretical work informs practical designs implemented by teams at Google and Meta Platforms in areas such as ad allocation and marketplace matching.

Honors and awards

Devanur's work has been recognized through conference presentations at venues including ACM Symposium on Theory of Computing, IEEE Symposium on Foundations of Computer Science, ACM-SIAM Symposium on Discrete Algorithms, and International Conference on Machine Learning. He has received fellowships and awards from institutions comparable to National Science Foundation graduate and postdoctoral funding programs, and has been an invited speaker at workshops organized by Simons Institute for the Theory of Computing, Institute for Advanced Study, and Banff International Research Station.

Selected publications

- Devanur, N. R., et al., papers on matching markets and online allocation presented at ACM Symposium on Theory of Computing and ACM-SIAM Symposium on Discrete Algorithms alongside coauthors from Stanford University and Princeton University. - Devanur, N. R., collaborative works on mechanism design and market equilibrium appearing in proceedings of IEEE Symposium on Foundations of Computer Science and in journals associated with SIAM and ACM. - Devanur, N. R., contributions to the literature on stochastic networks and queueing theory cited by researchers at Georgia Institute of Technology and Cornell University.

Category:Indian computer scientists Category:Theoretical computer scientists