About the Authors
Jugal Garg
Jugal Garg
University of Illinois
at Urbana-Champaign
jugal[ta]illinois[td]edu
jugal.ise.illinois.edu
Jugal Garg is currently a research assistant professor at the University of Illinois at Urbana-Champaign. Prior to that, he was a postdoctoral fellow at the Max-Planck-Institut für Informatik, Saarbrücken, Germany, and Georgia Tech, USA. He received his Ph.D. from IIT-Bombay, under the guidance of Milind Sohoni and Bharat Adsul, in August 2012. Jugal's research explores computational and strategic aspects of equilibria in game theory and economics, and their connections with dynamical systems and learning. He is interested broadly in the design and analysis of algorithms, optimization and mathematical programming. In his spare time, he likes long distance running, hiking and swimming.
Ruta Mehta
Ruta Mehta
Department of Computer Science
University of Illinois
at Urbana-Champaign
rutamehta[ta]cs[td]illinois[td]edu
rutamehta.cs.illinois.edu
Ruta Mehta is an assistant professor at the University of Illinois at Urbana-Champaign in the Department of Computer Science. Prior to joining UIUC, she did postdoc at the Simons Institute for the Theory of Computing at UC Berkeley (Aug'15 to Dec'15), and in the College of Computing at Georgia Tech (Aug'12 to July'15, host: Vijay Vazirani). She received her Ph.D. from IIT-Bombay under the guidance of Milind Sohoni and Bharat Adsul, in August 2012. She is a recipient of ACM India Doctoral Dissertation Award, 2012, and Outstanding Post-Doctoral Researcher Award 2014, College of Computing, Georgia Tech. Her main research interests lie in the area of algorithmic game theory, mathematical economics, and in designing efficient algorithms. In her spare time, she likes to listen to music and hike.
Vijay V. Vazirani
Vijay V. Vazirani
College of Computing
Georgia Institute of Technology
vijay[ta]cc[td]gatech[td]edu
cc.gatech.edu/~Vijay.Vazirani/
Vijay V. Vazirani got his Ph.D. from the University of California at Berkeley in 1983 under the supervision of Manuel Blum. He has made contributions to the theory of algorithms, in particular to the classical maximum matching problem, approximation algorithms, and complexity theory. Over the last decade and a half, he has contributed widely to an algorithmic study of economics and game theory.
In 2001 he published what was widely regarded as the definitive book on Approximation Algorithms. This book has been translated into Japanese, Polish, French, and Chinese. In 2007 he co-edited a comprehensive volume on Algorithmic Game Theory. He is an ACM Fellow and a Guggenheim Fellow. In his free time, he enjoys listening to music: Indian and Western Classical and Jazz.